/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_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:56:09,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:56:09,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:56:09,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:56:09,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:56:09,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:56:09,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:56:09,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:56:09,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:56:09,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:56:09,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:56:09,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:56:09,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:56:09,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:56:09,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:56:09,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:56:09,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:56:09,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:56:09,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:56:09,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:56:09,877 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:56:09,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:56:09,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:56:09,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:56:09,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:56:09,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:56:09,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:56:09,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:56:09,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:56:09,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:56:09,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:56:09,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:56:09,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:56:09,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:56:09,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:56:09,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:56:09,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:56:09,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:56:09,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:56:09,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:56:09,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:56:09,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:56:09,909 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:56:09,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:56:09,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:56:09,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:56:09,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:56:09,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:56:09,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:56:09,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:56:09,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:56:09,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:56:09,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:56:09,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:56:09,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:56:09,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:56:09,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:56:09,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:56:09,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:56:09,928 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:56:09,928 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:56:09,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:56:09,928 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:56:09,928 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:56:10,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:56:10,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:56:10,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:56:10,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:56:10,211 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:56:10,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_4.i [2022-04-15 05:56:10,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26127006/60afb6156e68450ea7c1e50dbd922a08/FLAG60646e3b1 [2022-04-15 05:56:10,700 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:56:10,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2022-04-15 05:56:10,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26127006/60afb6156e68450ea7c1e50dbd922a08/FLAG60646e3b1 [2022-04-15 05:56:11,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26127006/60afb6156e68450ea7c1e50dbd922a08 [2022-04-15 05:56:11,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:56:11,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:56:11,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:56:11,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:56:11,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:56:11,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541f00ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11, skipping insertion in model container [2022-04-15 05:56:11,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:56:11,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:56:11,289 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_4.i[848,861] [2022-04-15 05:56:11,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:56:11,326 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:56:11,343 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_4.i[848,861] [2022-04-15 05:56:11,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:56:11,367 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:56:11,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11 WrapperNode [2022-04-15 05:56:11,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:56:11,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:56:11,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:56:11,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:56:11,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:56:11,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:56:11,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:56:11,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:56:11,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (1/1) ... [2022-04-15 05:56:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:56:11,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:11,453 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:56:11,464 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:56:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:56:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:56:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:56:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:56:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:56:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:56:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:56:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:56:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:56:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:56:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:56:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:56:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:56:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:56:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:56:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:56:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:56:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:56:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:56:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:56:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:56:11,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:56:11,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:56:11,784 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:56:11,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:56:11,791 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 05:56:11,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:56:11 BoogieIcfgContainer [2022-04-15 05:56:11,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:56:11,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:56:11,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:56:11,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:56:11,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:56:11" (1/3) ... [2022-04-15 05:56:11,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75038c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:56:11, skipping insertion in model container [2022-04-15 05:56:11,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:56:11" (2/3) ... [2022-04-15 05:56:11,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75038c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:56:11, skipping insertion in model container [2022-04-15 05:56:11,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:56:11" (3/3) ... [2022-04-15 05:56:11,801 INFO L111 eAbstractionObserver]: Analyzing ICFG array_4.i [2022-04-15 05:56:11,806 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:56:11,807 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:56:11,855 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:56:11,864 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:56:11,864 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:56:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:56:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 05:56:11,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:11,899 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:11,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -615726646, now seen corresponding path program 1 times [2022-04-15 05:56:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:11,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986102919] [2022-04-15 05:56:11,922 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:56:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -615726646, now seen corresponding path program 2 times [2022-04-15 05:56:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:11,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339842536] [2022-04-15 05:56:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 05:56:12,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 05:56:12,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 05:56:12,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:12,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-15 05:56:12,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 05:56:12,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 05:56:12,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 05:56:12,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27#true} is VALID [2022-04-15 05:56:12,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 05:56:12,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28#false} is VALID [2022-04-15 05:56:12,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-15 05:56:12,117 INFO L272 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28#false} is VALID [2022-04-15 05:56:12,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 05:56:12,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 05:56:12,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 05:56:12,118 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:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339842536] [2022-04-15 05:56:12,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339842536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:12,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:12,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:56:12,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986102919] [2022-04-15 05:56:12,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986102919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:12,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:12,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:56:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082718554] [2022-04-15 05:56:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:12,130 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:12,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:12,135 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:56:12,151 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:56:12,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:56:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:12,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:56:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:56:12,172 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.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:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,257 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 05:56:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:56:12,258 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:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:12,264 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:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 05:56:12,272 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:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 05:56:12,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 05:56:12,334 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:12,341 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:56:12,341 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:56:12,343 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:12,346 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:12,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:56:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 05:56:12,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:12,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,400 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,400 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,417 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:56:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:56:12,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:12,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:12,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 05:56:12,418 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 05:56:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,421 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:56:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:56:12,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:12,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:12,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:12,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 05:56:12,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-15 05:56:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:12,426 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 05:56:12,426 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:12,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 05:56:12,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:56:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:56:12,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:12,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:12,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:56:12,474 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash 238110415, now seen corresponding path program 1 times [2022-04-15 05:56:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710889530] [2022-04-15 05:56:12,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:56:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 238110415, now seen corresponding path program 2 times [2022-04-15 05:56:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871003340] [2022-04-15 05:56:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {183#true} is VALID [2022-04-15 05:56:12,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 05:56:12,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 05:56:12,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:12,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {183#true} is VALID [2022-04-15 05:56:12,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 05:56:12,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 05:56:12,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret5 := main(); {183#true} is VALID [2022-04-15 05:56:12,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {188#(= main_~i~0 0)} is VALID [2022-04-15 05:56:12,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~i~0 0)} assume !(~i~0 < 1023); {184#false} is VALID [2022-04-15 05:56:12,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {184#false} is VALID [2022-04-15 05:56:12,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {184#false} is VALID [2022-04-15 05:56:12,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} assume !(0 != #t~mem4);havoc #t~mem4; {184#false} is VALID [2022-04-15 05:56:12,572 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {184#false} is VALID [2022-04-15 05:56:12,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-04-15 05:56:12,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2022-04-15 05:56:12,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-15 05:56:12,572 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:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871003340] [2022-04-15 05:56:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871003340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:12,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:12,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:12,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710889530] [2022-04-15 05:56:12,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710889530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:12,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:12,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718258046] [2022-04-15 05:56:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:56:12,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:12,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:12,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:56:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:56:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:56:12,590 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,706 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 05:56:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:56:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:56:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 05:56:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-15 05:56:12,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-15 05:56:12,768 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,770 INFO L225 Difference]: With dead ends: 32 [2022-04-15 05:56:12,771 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 05:56:12,771 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:12,772 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:12,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 05:56:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-04-15 05:56:12,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:12,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call 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,787 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call 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,788 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call 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,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,797 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 05:56:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 05:56:12,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:12,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:12,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 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 23 states. [2022-04-15 05:56:12,798 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 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 23 states. [2022-04-15 05:56:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:12,800 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 05:56:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 05:56:12,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:12,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:12,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:12,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call 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,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-15 05:56:12,802 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-15 05:56:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:12,803 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-15 05:56:12,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:12,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-15 05:56:12,830 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:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-15 05:56:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:56:12,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:12,831 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:12,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:56:12,832 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1502803825, now seen corresponding path program 1 times [2022-04-15 05:56:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:12,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527955736] [2022-04-15 05:56:12,860 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,860 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:12,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1502803825, now seen corresponding path program 2 times [2022-04-15 05:56:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:12,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791047328] [2022-04-15 05:56:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:12,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#(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(10, 2); {340#true} is VALID [2022-04-15 05:56:12,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 05:56:12,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 05:56:12,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:12,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#(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(10, 2); {340#true} is VALID [2022-04-15 05:56:12,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 05:56:12,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 05:56:12,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 05:56:12,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {345#(= main_~i~0 0)} is VALID [2022-04-15 05:56:12,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {345#(= main_~i~0 0)} is VALID [2022-04-15 05:56:12,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {346#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:12,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(<= main_~i~0 1)} assume !(~i~0 < 1023); {341#false} is VALID [2022-04-15 05:56:12,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {341#false} is VALID [2022-04-15 05:56:12,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {341#false} is VALID [2022-04-15 05:56:12,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#false} assume !(0 != #t~mem4);havoc #t~mem4; {341#false} is VALID [2022-04-15 05:56:12,943 INFO L272 TraceCheckUtils]: 12: Hoare triple {341#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {341#false} is VALID [2022-04-15 05:56:12,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2022-04-15 05:56:12,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2022-04-15 05:56:12,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 05:56:12,944 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:12,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:12,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791047328] [2022-04-15 05:56:12,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791047328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:12,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517707630] [2022-04-15 05:56:12,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:12,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:12,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:12,955 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:12,956 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:13,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:56:13,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:13,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:56:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:13,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-15 05:56:13,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(10, 2); {340#true} is VALID [2022-04-15 05:56:13,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 05:56:13,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #58#return; {340#true} is VALID [2022-04-15 05:56:13,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 05:56:13,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {340#true} is VALID [2022-04-15 05:56:13,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {340#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {340#true} is VALID [2022-04-15 05:56:13,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#true} is VALID [2022-04-15 05:56:13,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(~i~0 < 1023); {340#true} is VALID [2022-04-15 05:56:13,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:13,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:13,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= main_~i~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {378#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:13,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {378#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:13,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:13,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-15 05:56:13,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 05:56:13,233 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:13,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:56:13,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517707630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:13,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:56:13,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 05:56:13,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:13,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527955736] [2022-04-15 05:56:13,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527955736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:13,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:13,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:56:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766438330] [2022-04-15 05:56:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 05:56:13,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:13,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:13,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:13,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:56:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:13,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:56:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:56:13,258 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,360 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 05:56:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:56:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 05:56:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:56:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:56:13,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 05:56:13,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:13,387 INFO L225 Difference]: With dead ends: 27 [2022-04-15 05:56:13,388 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:56:13,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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:13,389 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:13,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:56:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 05:56:13,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:13,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:13,398 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:13,399 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,400 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 05:56:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 05:56:13,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:13,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:13,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 22 states. [2022-04-15 05:56:13,402 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 22 states. [2022-04-15 05:56:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,403 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 05:56:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 05:56:13,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:13,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:13,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:13,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 05:56:13,406 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-04-15 05:56:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:13,406 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 05:56:13,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:13,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-15 05:56:13,433 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:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 05:56:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:56:13,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:13,436 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:13,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 05:56:13,661 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:13,661 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1018715970, now seen corresponding path program 1 times [2022-04-15 05:56:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:13,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261073568] [2022-04-15 05:56:13,671 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,671 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:13,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1018715970, now seen corresponding path program 2 times [2022-04-15 05:56:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:13,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269431908] [2022-04-15 05:56:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(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(10, 2); {538#true} is VALID [2022-04-15 05:56:13,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:56:13,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 05:56:13,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:13,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(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(10, 2); {538#true} is VALID [2022-04-15 05:56:13,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:56:13,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 05:56:13,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 05:56:13,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {543#(= main_~i~0 0)} is VALID [2022-04-15 05:56:13,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {543#(= main_~i~0 0)} is VALID [2022-04-15 05:56:13,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {543#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {544#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:13,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(<= main_~i~0 1)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 05:56:13,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 05:56:13,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:13,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:13,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 05:56:13,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:13,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:13,732 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 05:56:13,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 05:56:13,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 05:56:13,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 05:56:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:56:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269431908] [2022-04-15 05:56:13,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269431908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:13,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230053887] [2022-04-15 05:56:13,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:13,735 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:13,761 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:13,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:13,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:13,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:56:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:13,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 05:56:13,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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(10, 2); {538#true} is VALID [2022-04-15 05:56:13,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:56:13,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 05:56:13,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 05:56:13,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {564#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:13,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {564#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {564#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:13,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {564#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {544#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:13,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(<= main_~i~0 1)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 05:56:13,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 05:56:13,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:13,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:13,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 05:56:13,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:13,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:13,911 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 05:56:13,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 05:56:13,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 05:56:13,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 05:56:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:56:13,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:14,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 05:56:14,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-15 05:56:14,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-15 05:56:14,023 INFO L272 TraceCheckUtils]: 15: Hoare triple {539#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {539#false} is VALID [2022-04-15 05:56:14,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#false} assume !(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:14,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:14,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {539#false} is VALID [2022-04-15 05:56:14,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !!(0 != #t~mem4);havoc #t~mem4; {539#false} is VALID [2022-04-15 05:56:14,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {539#false} is VALID [2022-04-15 05:56:14,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {539#false} is VALID [2022-04-15 05:56:14,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#(< main_~i~0 1023)} assume !(~i~0 < 1023); {539#false} is VALID [2022-04-15 05:56:14,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {634#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:14,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {638#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {638#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {638#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 05:56:14,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #58#return; {538#true} is VALID [2022-04-15 05:56:14,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 05:56:14,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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(10, 2); {538#true} is VALID [2022-04-15 05:56:14,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 05:56:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:56:14,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230053887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:14,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:14,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:56:14,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261073568] [2022-04-15 05:56:14,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261073568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:14,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:14,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:56:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734291087] [2022-04-15 05:56:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:14,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:56:14,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:14,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:14,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:14,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:56:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:14,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:56:14,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:56:14,051 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:14,181 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 05:56:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:56:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:56:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 05:56:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 05:56:14,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 05:56:14,226 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:14,228 INFO L225 Difference]: With dead ends: 39 [2022-04-15 05:56:14,228 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 05:56:14,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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:14,229 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:14,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 05:56:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-15 05:56:14,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:14,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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,245 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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,246 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:14,248 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 05:56:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 05:56:14,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:14,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:14,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 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 28 states. [2022-04-15 05:56:14,249 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 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 28 states. [2022-04-15 05:56:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:14,250 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 05:56:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 05:56:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:14,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:14,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call 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,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 05:56:14,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2022-04-15 05:56:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:14,253 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 05:56:14,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:14,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 05:56:14,279 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:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 05:56:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:56:14,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:14,280 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:14,308 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:14,499 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:14,500 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -706411172, now seen corresponding path program 3 times [2022-04-15 05:56:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576745143] [2022-04-15 05:56:14,506 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:14,507 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:14,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -706411172, now seen corresponding path program 4 times [2022-04-15 05:56:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:14,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801122564] [2022-04-15 05:56:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:14,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#(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(10, 2); {844#true} is VALID [2022-04-15 05:56:14,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 05:56:14,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 05:56:14,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:14,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#(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(10, 2); {844#true} is VALID [2022-04-15 05:56:14,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 05:56:14,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 05:56:14,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 05:56:14,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {844#true} is VALID [2022-04-15 05:56:14,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {844#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {844#true} is VALID [2022-04-15 05:56:14,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {844#true} is VALID [2022-04-15 05:56:14,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {844#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {844#true} is VALID [2022-04-15 05:56:14,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {844#true} is VALID [2022-04-15 05:56:14,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#true} assume !(~i~0 < 1023); {844#true} is VALID [2022-04-15 05:56:14,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {849#(= main_~i~0 0)} is VALID [2022-04-15 05:56:14,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {849#(= main_~i~0 0)} is VALID [2022-04-15 05:56:14,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {849#(= main_~i~0 0)} is VALID [2022-04-15 05:56:14,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {850#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {850#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {850#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {850#(<= main_~i~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {850#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,599 INFO L272 TraceCheckUtils]: 17: Hoare triple {850#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {851#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:56:14,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {851#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {852#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:56:14,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {845#false} is VALID [2022-04-15 05:56:14,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 05:56:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801122564] [2022-04-15 05:56:14,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801122564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605566139] [2022-04-15 05:56:14,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:14,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:14,603 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:14,613 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:14,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:14,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:56:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:14,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:14,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-15 05:56:14,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#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(10, 2); {844#true} is VALID [2022-04-15 05:56:14,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 05:56:14,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 05:56:14,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 05:56:14,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {872#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:14,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {872#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:14,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {850#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {885#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {885#(<= main_~i~0 2)} assume !(~i~0 < 1023); {845#false} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {845#false} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !!(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {845#false} is VALID [2022-04-15 05:56:14,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 05:56:14,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume !(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 05:56:14,774 INFO L272 TraceCheckUtils]: 17: Hoare triple {845#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {845#false} is VALID [2022-04-15 05:56:14,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-15 05:56:14,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-15 05:56:14,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 05:56:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:56:14,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:14,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-15 05:56:14,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-15 05:56:14,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-15 05:56:14,891 INFO L272 TraceCheckUtils]: 17: Hoare triple {845#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {845#false} is VALID [2022-04-15 05:56:14,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume !(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 05:56:14,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 05:56:14,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {845#false} is VALID [2022-04-15 05:56:14,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !!(0 != #t~mem4);havoc #t~mem4; {845#false} is VALID [2022-04-15 05:56:14,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {845#false} is VALID [2022-04-15 05:56:14,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {845#false} is VALID [2022-04-15 05:56:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(< main_~i~0 1023)} assume !(~i~0 < 1023); {845#false} is VALID [2022-04-15 05:56:14,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {953#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {949#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:14,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {953#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {953#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {953#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {960#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:14,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {960#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:14,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret5 := main(); {844#true} is VALID [2022-04-15 05:56:14,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #58#return; {844#true} is VALID [2022-04-15 05:56:14,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-15 05:56:14,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#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(10, 2); {844#true} is VALID [2022-04-15 05:56:14,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-15 05:56:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:56:14,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605566139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:14,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:14,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 05:56:14,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:14,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576745143] [2022-04-15 05:56:14,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576745143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:14,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:14,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:56:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080841852] [2022-04-15 05:56:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:14,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:14,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:14,917 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:14,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:56:14,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:56:14,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:56:14,922 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,092 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 05:56:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:56:15,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 05:56:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 05:56:15,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 05:56:15,121 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:15,122 INFO L225 Difference]: With dead ends: 32 [2022-04-15 05:56:15,122 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:56:15,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 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:15,123 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:15,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:56:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-15 05:56:15,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:15,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call 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,136 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call 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,137 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call 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,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,138 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 05:56:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 05:56:15,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:15,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:15,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 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 27 states. [2022-04-15 05:56:15,139 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 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 27 states. [2022-04-15 05:56:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,140 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-15 05:56:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 05:56:15,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:15,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:15,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:15,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call 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,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 05:56:15,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-04-15 05:56:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:15,142 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 05:56:15,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 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:15,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 05:56:15,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 05:56:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:56:15,167 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:15,167 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:15,198 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:15,395 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:15,396 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 336152307, now seen corresponding path program 5 times [2022-04-15 05:56:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:15,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652636647] [2022-04-15 05:56:15,401 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,401 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:15,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash 336152307, now seen corresponding path program 6 times [2022-04-15 05:56:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:15,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023890321] [2022-04-15 05:56:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#(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(10, 2); {1162#true} is VALID [2022-04-15 05:56:15,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 05:56:15,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 05:56:15,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:15,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#(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(10, 2); {1162#true} is VALID [2022-04-15 05:56:15,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 05:56:15,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 05:56:15,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 05:56:15,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1167#(= main_~i~0 0)} is VALID [2022-04-15 05:56:15,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1167#(= main_~i~0 0)} is VALID [2022-04-15 05:56:15,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#(<= main_~i~0 2)} assume !(~i~0 < 1023); {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {1163#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {1163#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1163#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 05:56:15,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {1163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {1163#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {1163#false} assume !(0 != #t~mem4);havoc #t~mem4; {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L272 TraceCheckUtils]: 20: Hoare triple {1163#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {1163#false} ~cond := #in~cond; {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {1163#false} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 05:56:15,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 05:56:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023890321] [2022-04-15 05:56:15,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023890321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:15,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748158958] [2022-04-15 05:56:15,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:15,492 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:15,519 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:15,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:56:15,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:15,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:15,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2022-04-15 05:56:15,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#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(10, 2); {1162#true} is VALID [2022-04-15 05:56:15,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 05:56:15,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 05:56:15,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 05:56:15,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#true} assume !(~i~0 < 1023); {1162#true} is VALID [2022-04-15 05:56:15,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1207#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:15,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1207#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:15,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {1207#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {1207#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:15,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1207#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1168#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1168#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {1168#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1169#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {1169#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,701 INFO L272 TraceCheckUtils]: 20: Hoare triple {1169#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:15,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:15,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 05:56:15,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 05:56:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:15,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:15,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2022-04-15 05:56:15,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1163#false} is VALID [2022-04-15 05:56:15,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:15,853 INFO L272 TraceCheckUtils]: 20: Hoare triple {1255#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:15,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {1255#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:15,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:15,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {1265#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1255#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:15,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:15,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:15,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1265#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:15,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:15,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {1275#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1275#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#true} assume !(~i~0 < 1023); {1162#true} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1162#true} is VALID [2022-04-15 05:56:15,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {1162#true} call #t~ret5 := main(); {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1162#true} #58#return; {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1162#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(10, 2); {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2022-04-15 05:56:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748158958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:15,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:15,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-04-15 05:56:15,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652636647] [2022-04-15 05:56:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652636647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:15,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:15,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:56:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947472905] [2022-04-15 05:56:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:15,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:56:15,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:15,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:15,894 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:15,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:56:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:56:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:56:15,896 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:16,031 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 05:56:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:56:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:56:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 05:56:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 05:56:16,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 05:56:16,074 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:16,077 INFO L225 Difference]: With dead ends: 47 [2022-04-15 05:56:16,077 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:56:16,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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:16,080 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:16,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:56:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-15 05:56:16,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:16,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,103 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,103 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:16,106 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 05:56:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 05:56:16,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:16,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:16,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 05:56:16,110 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 05:56:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:16,113 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 05:56:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 05:56:16,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:16,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:16,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:16,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 05:56:16,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2022-04-15 05:56:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:16,115 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 05:56:16,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 05:56:16,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 05:56:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:56:16,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:16,142 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:16,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:16,355 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:16,356 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash -842525419, now seen corresponding path program 7 times [2022-04-15 05:56:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:16,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658004524] [2022-04-15 05:56:16,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:16,361 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:16,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -842525419, now seen corresponding path program 8 times [2022-04-15 05:56:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876428895] [2022-04-15 05:56:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:16,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {1549#(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(10, 2); {1540#true} is VALID [2022-04-15 05:56:16,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 05:56:16,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 05:56:16,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:16,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1549#(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(10, 2); {1540#true} is VALID [2022-04-15 05:56:16,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 05:56:16,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 05:56:16,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 05:56:16,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1545#(= main_~i~0 0)} is VALID [2022-04-15 05:56:16,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {1545#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1545#(= main_~i~0 0)} is VALID [2022-04-15 05:56:16,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {1547#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {1547#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1548#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:16,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#(<= main_~i~0 3)} assume !(~i~0 < 1023); {1541#false} is VALID [2022-04-15 05:56:16,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1541#false} is VALID [2022-04-15 05:56:16,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 05:56:16,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {1541#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {1541#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {1541#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {1541#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {1541#false} assume !(0 != #t~mem4);havoc #t~mem4; {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L272 TraceCheckUtils]: 22: Hoare triple {1541#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1541#false} is VALID [2022-04-15 05:56:16,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {1541#false} ~cond := #in~cond; {1541#false} is VALID [2022-04-15 05:56:16,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {1541#false} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 05:56:16,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 05:56:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876428895] [2022-04-15 05:56:16,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876428895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696179440] [2022-04-15 05:56:16,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:16,468 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:16,470 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:16,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:16,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:16,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:16,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:16,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#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(10, 2); {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#true} assume !(~i~0 < 1023); {1540#true} is VALID [2022-04-15 05:56:16,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1592#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {1592#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1592#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {1592#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {1592#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {1592#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {1546#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1546#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {1546#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {1546#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {1546#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {1547#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1547#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {1547#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,656 INFO L272 TraceCheckUtils]: 22: Hoare triple {1547#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:16,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:16,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {1624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 05:56:16,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 05:56:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:56:16,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:16,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-04-15 05:56:16,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {1624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1541#false} is VALID [2022-04-15 05:56:16,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:16,809 INFO L272 TraceCheckUtils]: 22: Hoare triple {1640#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:16,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {1640#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:16,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:16,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {1650#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1640#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:16,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {1650#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:16,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:16,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1650#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:16,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1660#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#true} assume !(~i~0 < 1023); {1540#true} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret5 := main(); {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #58#return; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1540#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(10, 2); {1540#true} is VALID [2022-04-15 05:56:16,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1540#true} is VALID [2022-04-15 05:56:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:56:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696179440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:16,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:16,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-15 05:56:16,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658004524] [2022-04-15 05:56:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658004524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:16,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:56:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109399285] [2022-04-15 05:56:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:56:16,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:16,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:16,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:16,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:56:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:16,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:56:16,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:56:16,831 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,018 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 05:56:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:56:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:56:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 05:56:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 05:56:17,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-15 05:56:17,072 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,073 INFO L225 Difference]: With dead ends: 53 [2022-04-15 05:56:17,073 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 05:56:17,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-15 05:56:17,074 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:17,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 26 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 05:56:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-04-15 05:56:17,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:17,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call 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,097 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call 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,098 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call 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,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,099 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 05:56:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 05:56:17,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:17,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:17,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 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 39 states. [2022-04-15 05:56:17,100 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 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 39 states. [2022-04-15 05:56:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,101 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 05:56:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 05:56:17,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:17,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:17,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:17,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call 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,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 05:56:17,103 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2022-04-15 05:56:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:17,103 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 05:56:17,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:17,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 05:56:17,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 05:56:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:56:17,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:17,133 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:17,156 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:17,351 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:17,352 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 319546039, now seen corresponding path program 9 times [2022-04-15 05:56:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:17,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980848129] [2022-04-15 05:56:17,357 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,357 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:17,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash 319546039, now seen corresponding path program 10 times [2022-04-15 05:56:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:17,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817541648] [2022-04-15 05:56:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#(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(10, 2); {1961#true} is VALID [2022-04-15 05:56:17,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 05:56:17,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 05:56:17,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:17,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#(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(10, 2); {1961#true} is VALID [2022-04-15 05:56:17,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 05:56:17,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 05:56:17,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 05:56:17,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1966#(= main_~i~0 0)} is VALID [2022-04-15 05:56:17,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {1966#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1966#(= main_~i~0 0)} is VALID [2022-04-15 05:56:17,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {1967#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {1969#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {1969#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1970#(<= main_~i~0 4)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 05:56:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817541648] [2022-04-15 05:56:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817541648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941467242] [2022-04-15 05:56:17,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:17,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:17,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:17,435 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:17,464 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:17,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:17,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:17,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:17,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2022-04-15 05:56:17,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#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(10, 2); {1961#true} is VALID [2022-04-15 05:56:17,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 05:56:17,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 05:56:17,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 05:56:17,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1990#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:17,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1990#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1990#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1990#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1967#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1967#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1968#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {1969#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1969#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {1969#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1970#(<= main_~i~0 4)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 05:56:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:17,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {1962#false} assume 0 == ~cond; {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {1962#false} ~cond := #in~cond; {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {1962#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#false} assume !(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1962#false} is VALID [2022-04-15 05:56:17,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#(< main_~i~0 1023)} assume !(~i~0 < 1023); {1962#false} is VALID [2022-04-15 05:56:17,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {2100#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2096#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:17,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {2100#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2100#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:17,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {2107#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2100#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:17,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {2107#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2107#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:17,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {2114#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2107#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:17,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {2114#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2114#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:17,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {2121#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2114#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:17,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {2121#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2121#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:17,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2121#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:17,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1961#true} call #t~ret5 := main(); {1961#true} is VALID [2022-04-15 05:56:17,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1961#true} {1961#true} #58#return; {1961#true} is VALID [2022-04-15 05:56:17,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume true; {1961#true} is VALID [2022-04-15 05:56:17,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#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(10, 2); {1961#true} is VALID [2022-04-15 05:56:17,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2022-04-15 05:56:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:17,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941467242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:17,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:17,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:56:17,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:17,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980848129] [2022-04-15 05:56:17,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980848129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:17,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:17,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:56:17,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147622752] [2022-04-15 05:56:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:56:17,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:17,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:17,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:17,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:56:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:56:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:56:17,807 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:18,033 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 05:56:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:56:18,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 05:56:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 05:56:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-15 05:56:18,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-15 05:56:18,081 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:18,082 INFO L225 Difference]: With dead ends: 59 [2022-04-15 05:56:18,082 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 05:56:18,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 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:18,083 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:18,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 26 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 05:56:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-15 05:56:18,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:18,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,108 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,108 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:18,110 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 05:56:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 05:56:18,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:18,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:18,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 05:56:18,111 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 05:56:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:18,112 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 05:56:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 05:56:18,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:18,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:18,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:18,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 05:56:18,114 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2022-04-15 05:56:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:18,114 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 05:56:18,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 05:56:18,143 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:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 05:56:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:56:18,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:18,144 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:18,171 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:18,359 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:18,360 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 378720217, now seen corresponding path program 11 times [2022-04-15 05:56:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159969371] [2022-04-15 05:56:18,367 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:18,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:18,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash 378720217, now seen corresponding path program 12 times [2022-04-15 05:56:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:18,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682785284] [2022-04-15 05:56:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:18,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {2436#(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(10, 2); {2425#true} is VALID [2022-04-15 05:56:18,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 05:56:18,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 05:56:18,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:18,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#(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(10, 2); {2425#true} is VALID [2022-04-15 05:56:18,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 05:56:18,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 05:56:18,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 05:56:18,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2430#(= main_~i~0 0)} is VALID [2022-04-15 05:56:18,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {2430#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2430#(= main_~i~0 0)} is VALID [2022-04-15 05:56:18,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:18,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {2431#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:18,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {2431#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:18,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {2432#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:18,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {2432#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2433#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:18,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {2433#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2433#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:18,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {2433#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2434#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:18,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {2434#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2434#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:18,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {2434#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2435#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {2435#(<= main_~i~0 5)} assume !(~i~0 < 1023); {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {2426#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {2426#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {2426#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2426#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 05:56:18,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {2426#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {2426#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {2426#false} assume !(0 != #t~mem4);havoc #t~mem4; {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L272 TraceCheckUtils]: 26: Hoare triple {2426#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {2426#false} ~cond := #in~cond; {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {2426#false} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 05:56:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682785284] [2022-04-15 05:56:18,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682785284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974099143] [2022-04-15 05:56:18,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:18,474 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:18,502 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:18,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:18,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:18,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:18,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:18,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#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(10, 2); {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {2425#true} assume !(~i~0 < 1023); {2425#true} is VALID [2022-04-15 05:56:18,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {2425#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2491#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:18,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {2491#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2491#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:18,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {2491#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:18,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:18,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {2431#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2431#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:18,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {2431#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:18,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:18,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {2432#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2432#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:18,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2432#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {2432#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:18,688 INFO L272 TraceCheckUtils]: 26: Hoare triple {2432#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:18,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:18,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {2523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 05:56:18,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 05:56:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:56:18,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:18,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-15 05:56:18,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {2523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2426#false} is VALID [2022-04-15 05:56:18,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:18,851 INFO L272 TraceCheckUtils]: 26: Hoare triple {2539#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:18,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:18,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:18,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2539#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:18,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:18,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:18,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2549#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:18,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2425#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2559#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2425#true} assume !(~i~0 < 1023); {2425#true} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret5 := main(); {2425#true} is VALID [2022-04-15 05:56:18,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #58#return; {2425#true} is VALID [2022-04-15 05:56:18,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-15 05:56:18,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#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(10, 2); {2425#true} is VALID [2022-04-15 05:56:18,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-15 05:56:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:56:18,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974099143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:18,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:18,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 05:56:18,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159969371] [2022-04-15 05:56:18,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159969371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:18,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:18,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:56:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049749656] [2022-04-15 05:56:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:56:18,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:18,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:18,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:18,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:56:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:56:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:56:18,881 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,212 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 05:56:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:56:19,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 05:56:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-04-15 05:56:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-04-15 05:56:19,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2022-04-15 05:56:19,282 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:19,285 INFO L225 Difference]: With dead ends: 65 [2022-04-15 05:56:19,286 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 05:56:19,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 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:19,288 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:19,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 46 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 05:56:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-04-15 05:56:19,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:19,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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:19,339 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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:19,340 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,341 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 05:56:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 05:56:19,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:19,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:19,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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 51 states. [2022-04-15 05:56:19,342 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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 51 states. [2022-04-15 05:56:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,343 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 05:56:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 05:56:19,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:19,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:19,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:19,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-15 05:56:19,344 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2022-04-15 05:56:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:19,345 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-15 05:56:19,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:19,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-15 05:56:19,376 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:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 05:56:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:56:19,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:19,377 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:19,405 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:19,591 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:19,592 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1410530427, now seen corresponding path program 13 times [2022-04-15 05:56:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966337526] [2022-04-15 05:56:19,596 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,597 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:19,597 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1410530427, now seen corresponding path program 14 times [2022-04-15 05:56:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598243556] [2022-04-15 05:56:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:19,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {2944#(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(10, 2); {2932#true} is VALID [2022-04-15 05:56:19,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 05:56:19,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 05:56:19,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:19,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#(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(10, 2); {2932#true} is VALID [2022-04-15 05:56:19,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 05:56:19,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 05:56:19,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 05:56:19,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2937#(= main_~i~0 0)} is VALID [2022-04-15 05:56:19,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {2937#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2937#(= main_~i~0 0)} is VALID [2022-04-15 05:56:19,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {2939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {2940#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {2940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {2941#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {2942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2943#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {2943#(<= main_~i~0 6)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:19,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 05:56:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:19,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:19,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598243556] [2022-04-15 05:56:19,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598243556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:19,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352614339] [2022-04-15 05:56:19,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:19,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:19,697 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:19,721 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:19,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:19,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:19,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:56:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:19,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:19,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-15 05:56:19,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(10, 2); {2932#true} is VALID [2022-04-15 05:56:19,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 05:56:19,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 05:56:19,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 05:56:19,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2963#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:19,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {2963#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2963#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:19,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {2963#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2938#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2939#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {2939#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {2940#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2940#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {2940#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {2941#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2941#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {2941#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {2942#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2942#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {2942#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2943#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {2943#(<= main_~i~0 6)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:19,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:19,909 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 05:56:19,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 05:56:19,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 05:56:19,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 05:56:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:19,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L272 TraceCheckUtils]: 28: Hoare triple {2933#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#false} assume !(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:20,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {2933#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2933#false} is VALID [2022-04-15 05:56:20,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2933#false} is VALID [2022-04-15 05:56:20,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {3081#(< main_~i~0 1023)} assume !(~i~0 < 1023); {2933#false} is VALID [2022-04-15 05:56:20,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {3085#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3081#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:20,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {3085#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3085#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:20,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {3092#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3085#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:20,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {3092#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3092#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:20,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {3099#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3092#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:20,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {3099#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3099#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:20,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {3106#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3099#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:20,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3106#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:20,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {3113#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:20,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {3113#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3113#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:20,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {3120#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3113#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:20,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3120#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:20,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3120#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:20,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret5 := main(); {2932#true} is VALID [2022-04-15 05:56:20,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #58#return; {2932#true} is VALID [2022-04-15 05:56:20,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-15 05:56:20,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(10, 2); {2932#true} is VALID [2022-04-15 05:56:20,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-15 05:56:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:20,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352614339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:20,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 05:56:20,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966337526] [2022-04-15 05:56:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966337526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:20,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:56:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673613199] [2022-04-15 05:56:20,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:20,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 05:56:20,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:20,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:20,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:56:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:56:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:56:20,163 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:20,543 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-15 05:56:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:56:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 05:56:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-15 05:56:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-15 05:56:20,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-15 05:56:20,612 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:20,614 INFO L225 Difference]: With dead ends: 71 [2022-04-15 05:56:20,614 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 05:56:20,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 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:20,615 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:20,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 36 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 05:56:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-04-15 05:56:20,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:20,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,659 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,659 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:20,661 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 05:56:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-15 05:56:20,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:20,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:20,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 05:56:20,663 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 05:56:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:20,664 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 05:56:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-04-15 05:56:20,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:20,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:20,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:20,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-15 05:56:20,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2022-04-15 05:56:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:20,666 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-15 05:56:20,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:20,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-15 05:56:20,701 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:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 05:56:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 05:56:20,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:20,704 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:20,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 05:56:20,923 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:20,924 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 842696861, now seen corresponding path program 15 times [2022-04-15 05:56:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:20,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291540404] [2022-04-15 05:56:20,929 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:20,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:20,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 842696861, now seen corresponding path program 16 times [2022-04-15 05:56:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:20,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135655010] [2022-04-15 05:56:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:21,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:21,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {3497#(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(10, 2); {3484#true} is VALID [2022-04-15 05:56:21,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 05:56:21,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 05:56:21,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:21,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {3497#(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(10, 2); {3484#true} is VALID [2022-04-15 05:56:21,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 05:56:21,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 05:56:21,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 05:56:21,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3489#(= main_~i~0 0)} is VALID [2022-04-15 05:56:21,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {3489#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3489#(= main_~i~0 0)} is VALID [2022-04-15 05:56:21,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {3489#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:21,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:21,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:21,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:21,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:21,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {3492#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:21,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {3492#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:21,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:21,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:21,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:21,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:21,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3496#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= main_~i~0 7)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 05:56:21,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 05:56:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:21,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:21,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135655010] [2022-04-15 05:56:21,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135655010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:21,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590501772] [2022-04-15 05:56:21,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:21,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:21,033 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:21,057 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:21,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:21,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:21,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:56:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:21,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:21,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3484#true} is VALID [2022-04-15 05:56:21,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#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(10, 2); {3484#true} is VALID [2022-04-15 05:56:21,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 05:56:21,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 05:56:21,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 05:56:21,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3516#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:21,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3516#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:21,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {3516#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:21,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3490#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:21,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:21,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3491#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:21,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:21,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {3492#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3492#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:21,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {3492#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:21,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3493#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:21,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:21,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3494#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:21,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3494#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:21,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3495#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:21,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3496#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:21,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= main_~i~0 7)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 05:56:21,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 05:56:21,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 05:56:21,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 05:56:21,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 05:56:21,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 05:56:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:21,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:21,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-04-15 05:56:21,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} assume 0 == ~cond; {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} ~cond := #in~cond; {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L272 TraceCheckUtils]: 30: Hoare triple {3485#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#false} assume !(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3485#false} is VALID [2022-04-15 05:56:21,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#false} assume !!(0 != #t~mem4);havoc #t~mem4; {3485#false} is VALID [2022-04-15 05:56:21,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {3485#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {3485#false} is VALID [2022-04-15 05:56:21,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {3485#false} is VALID [2022-04-15 05:56:21,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {3640#(< main_~i~0 1023)} assume !(~i~0 < 1023); {3485#false} is VALID [2022-04-15 05:56:21,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {3644#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3640#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:21,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {3644#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3644#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:21,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {3651#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3644#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:21,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {3651#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3651#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:21,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {3658#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3651#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:21,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {3658#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3658#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:21,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {3665#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3658#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:21,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {3665#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3665#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:21,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {3672#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3665#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:21,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {3672#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3672#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:21,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {3679#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3672#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:21,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {3679#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3679#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:21,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {3686#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3679#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:21,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {3686#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3686#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:21,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {3484#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3686#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:21,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {3484#true} call #t~ret5 := main(); {3484#true} is VALID [2022-04-15 05:56:21,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3484#true} {3484#true} #58#return; {3484#true} is VALID [2022-04-15 05:56:21,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-04-15 05:56:21,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#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(10, 2); {3484#true} is VALID [2022-04-15 05:56:21,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {3484#true} call ULTIMATE.init(); {3484#true} is VALID [2022-04-15 05:56:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:21,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590501772] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:21,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:21,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:56:21,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291540404] [2022-04-15 05:56:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291540404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:21,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:56:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755077314] [2022-04-15 05:56:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 05:56:21,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:21,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:21,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:21,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:56:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:56:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:56:21,577 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:21,991 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-15 05:56:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:56:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 05:56:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-04-15 05:56:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-04-15 05:56:21,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2022-04-15 05:56:22,060 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:56:22,061 INFO L225 Difference]: With dead ends: 77 [2022-04-15 05:56:22,061 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 05:56:22,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 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:22,063 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:22,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 05:56:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2022-04-15 05:56:22,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:22,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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:22,107 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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:22,107 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:22,109 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 05:56:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-15 05:56:22,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:22,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:22,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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 63 states. [2022-04-15 05:56:22,109 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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 63 states. [2022-04-15 05:56:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:22,111 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 05:56:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-15 05:56:22,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:22,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:22,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:22,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 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:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 05:56:22,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2022-04-15 05:56:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:22,113 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 05:56:22,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:22,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 05:56:22,150 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:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 05:56:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:56:22,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:22,151 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:22,175 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:22,375 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:22,376 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 615486527, now seen corresponding path program 17 times [2022-04-15 05:56:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:22,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970518129] [2022-04-15 05:56:22,380 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,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:22,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 615486527, now seen corresponding path program 18 times [2022-04-15 05:56:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:22,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42670635] [2022-04-15 05:56:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {4094#(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(10, 2); {4080#true} is VALID [2022-04-15 05:56:22,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 05:56:22,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 05:56:22,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:22,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {4094#(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(10, 2); {4080#true} is VALID [2022-04-15 05:56:22,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 05:56:22,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 05:56:22,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 05:56:22,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4085#(= main_~i~0 0)} is VALID [2022-04-15 05:56:22,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {4085#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4085#(= main_~i~0 0)} is VALID [2022-04-15 05:56:22,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {4085#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {4086#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {4086#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {4087#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4088#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:22,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4088#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:22,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {4088#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4089#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:22,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {4089#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4089#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:22,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {4089#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4090#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:22,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {4090#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4090#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:22,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {4090#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4091#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:22,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {4091#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4091#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:22,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {4091#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4092#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:22,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {4092#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4092#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:22,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {4092#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4093#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:22,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {4093#(<= main_~i~0 8)} assume !(~i~0 < 1023); {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {4081#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {4081#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {4081#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {4081#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {4081#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {4081#false} assume !(0 != #t~mem4);havoc #t~mem4; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L272 TraceCheckUtils]: 32: Hoare triple {4081#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-15 05:56:22,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 05:56:22,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 05:56:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:22,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42670635] [2022-04-15 05:56:22,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42670635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:22,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613336976] [2022-04-15 05:56:22,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:22,504 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:22,532 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:22,583 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:22,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:22,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:22,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#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(10, 2); {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {4080#true} assume !(~i~0 < 1023); {4080#true} is VALID [2022-04-15 05:56:22,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {4080#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4167#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {4167#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4167#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {4167#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {4167#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {4167#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {4086#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4086#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {4086#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {4086#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {4086#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {4087#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4087#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {4087#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {4087#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,750 INFO L272 TraceCheckUtils]: 32: Hoare triple {4087#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:22,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:22,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {4199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 05:56:22,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 05:56:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:56:22,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:22,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 05:56:22,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {4199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 05:56:22,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:22,917 INFO L272 TraceCheckUtils]: 32: Hoare triple {4215#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:22,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {4215#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:22,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {4215#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:22,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {4225#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4215#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:22,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {4225#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:22,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {4225#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:22,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {4235#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4225#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:22,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {4235#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:22,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {4235#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:22,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {4080#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4235#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:22,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {4080#true} assume !(~i~0 < 1023); {4080#true} is VALID [2022-04-15 05:56:22,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#true} is VALID [2022-04-15 05:56:22,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4080#true} is VALID [2022-04-15 05:56:22,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4080#true} is VALID [2022-04-15 05:56:22,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret5 := main(); {4080#true} is VALID [2022-04-15 05:56:22,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #58#return; {4080#true} is VALID [2022-04-15 05:56:22,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 05:56:22,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#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(10, 2); {4080#true} is VALID [2022-04-15 05:56:22,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 05:56:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:56:22,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613336976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:22,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:22,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-04-15 05:56:22,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:22,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970518129] [2022-04-15 05:56:22,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970518129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:22,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:22,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:56:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383994734] [2022-04-15 05:56:22,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:56:22,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:22,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:22,972 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:22,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:56:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:56:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:56:22,973 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:23,449 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 05:56:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:56:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 05:56:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-04-15 05:56:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2022-04-15 05:56:23,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2022-04-15 05:56:23,523 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:56:23,524 INFO L225 Difference]: With dead ends: 83 [2022-04-15 05:56:23,524 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 05:56:23,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 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:23,529 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:23,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 05:56:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-04-15 05:56:23,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:23,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,581 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,581 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:23,582 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-15 05:56:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-04-15 05:56:23,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:23,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:23,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 05:56:23,583 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 05:56:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:23,585 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-15 05:56:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-04-15 05:56:23,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:23,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:23,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:23,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 05:56:23,586 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2022-04-15 05:56:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:23,586 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 05:56:23,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:23,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 05:56:23,626 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:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 05:56:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:56:23,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:23,627 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:23,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 05:56:23,831 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:23,832 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1309687649, now seen corresponding path program 19 times [2022-04-15 05:56:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:23,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570640008] [2022-04-15 05:56:23,836 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:23,836 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:23,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1309687649, now seen corresponding path program 20 times [2022-04-15 05:56:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797866566] [2022-04-15 05:56:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:23,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {4731#(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(10, 2); {4716#true} is VALID [2022-04-15 05:56:23,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 05:56:23,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 05:56:23,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:23,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {4731#(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(10, 2); {4716#true} is VALID [2022-04-15 05:56:23,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 05:56:23,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 05:56:23,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 05:56:23,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4721#(= main_~i~0 0)} is VALID [2022-04-15 05:56:23,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {4721#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4721#(= main_~i~0 0)} is VALID [2022-04-15 05:56:23,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {4721#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:23,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {4722#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:23,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {4722#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:23,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {4723#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:23,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {4723#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:23,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:23,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:23,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {4725#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:23,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {4725#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:23,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {4726#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:23,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {4726#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:23,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {4727#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:23,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {4727#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:23,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {4728#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:23,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {4728#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:23,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {4729#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {4729#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {4730#(<= main_~i~0 9)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:23,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 05:56:23,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 05:56:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797866566] [2022-04-15 05:56:23,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797866566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434350721] [2022-04-15 05:56:23,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:23,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:23,960 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:23,984 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:24,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:24,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:24,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:56:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:24,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:24,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4716#true} is VALID [2022-04-15 05:56:24,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#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(10, 2); {4716#true} is VALID [2022-04-15 05:56:24,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 05:56:24,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 05:56:24,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 05:56:24,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4750#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:24,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {4750#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4750#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:24,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {4750#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {4722#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4722#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {4722#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {4723#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4723#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {4723#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4724#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {4725#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4725#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {4725#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {4726#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4726#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {4726#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {4727#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4727#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4727#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {4728#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4728#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {4728#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {4729#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4729#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {4729#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4730#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:24,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {4730#(<= main_~i~0 9)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 05:56:24,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 05:56:24,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 05:56:24,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 05:56:24,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 05:56:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:24,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:24,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {4717#false} assume !false; {4717#false} is VALID [2022-04-15 05:56:24,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {4717#false} assume 0 == ~cond; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {4717#false} ~cond := #in~cond; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L272 TraceCheckUtils]: 34: Hoare triple {4717#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {4717#false} assume !(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {4717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {4717#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {4717#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4717#false} is VALID [2022-04-15 05:56:24,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {4717#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4717#false} is VALID [2022-04-15 05:56:24,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {4886#(< main_~i~0 1023)} assume !(~i~0 < 1023); {4717#false} is VALID [2022-04-15 05:56:24,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {4890#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4886#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:24,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {4890#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4890#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:24,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {4897#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4890#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:24,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {4897#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4897#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:24,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {4904#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4897#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:24,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {4904#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4904#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:24,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {4911#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4904#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:24,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4911#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:24,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {4918#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4911#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:24,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {4918#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4918#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:24,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {4925#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4918#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:24,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {4925#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4925#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:24,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {4932#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4925#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:24,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {4932#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4932#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:24,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {4939#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4932#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:24,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {4939#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4939#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:24,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {4946#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4939#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:24,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {4946#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4946#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:24,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {4716#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4946#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:24,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {4716#true} call #t~ret5 := main(); {4716#true} is VALID [2022-04-15 05:56:24,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4716#true} {4716#true} #58#return; {4716#true} is VALID [2022-04-15 05:56:24,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {4716#true} assume true; {4716#true} is VALID [2022-04-15 05:56:24,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {4716#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(10, 2); {4716#true} is VALID [2022-04-15 05:56:24,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {4716#true} call ULTIMATE.init(); {4716#true} is VALID [2022-04-15 05:56:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434350721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:24,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:56:24,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570640008] [2022-04-15 05:56:24,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570640008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:24,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:24,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:56:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770895289] [2022-04-15 05:56:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 05:56:24,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:24,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:24,655 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:24,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:56:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:56:24,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:56:24,656 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:25,206 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-04-15 05:56:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:56:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 05:56:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-04-15 05:56:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-04-15 05:56:25,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 94 transitions. [2022-04-15 05:56:25,290 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:56:25,292 INFO L225 Difference]: With dead ends: 89 [2022-04-15 05:56:25,292 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 05:56:25,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:56:25,293 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:25,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 26 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 05:56:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2022-04-15 05:56:25,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:25,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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:25,351 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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:25,351 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:25,353 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 05:56:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 05:56:25,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:25,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:25,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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 75 states. [2022-04-15 05:56:25,353 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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 75 states. [2022-04-15 05:56:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:25,355 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 05:56:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-04-15 05:56:25,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:25,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:25,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:25,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-15 05:56:25,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2022-04-15 05:56:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:25,357 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-15 05:56:25,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:25,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-15 05:56:25,404 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:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 05:56:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 05:56:25,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:25,405 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:25,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 05:56:25,605 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:25,605 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1577932285, now seen corresponding path program 21 times [2022-04-15 05:56:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:25,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851229227] [2022-04-15 05:56:25,609 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:25,610 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:25,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1577932285, now seen corresponding path program 22 times [2022-04-15 05:56:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:25,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098372261] [2022-04-15 05:56:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:25,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {5416#(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(10, 2); {5400#true} is VALID [2022-04-15 05:56:25,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 05:56:25,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 05:56:25,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:25,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {5416#(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(10, 2); {5400#true} is VALID [2022-04-15 05:56:25,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 05:56:25,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 05:56:25,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 05:56:25,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5405#(= main_~i~0 0)} is VALID [2022-04-15 05:56:25,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {5405#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5405#(= main_~i~0 0)} is VALID [2022-04-15 05:56:25,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {5405#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:25,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:25,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:25,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {5407#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:25,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:25,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {5408#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:25,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {5408#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:25,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {5409#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:25,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:25,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {5410#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:25,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:25,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {5411#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 05:56:25,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {5411#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:25,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {5412#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:25,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {5412#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:25,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {5413#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:25,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {5413#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:25,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {5414#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:25,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5415#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:25,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {5415#(<= main_~i~0 10)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 05:56:25,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 05:56:25,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 05:56:25,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 05:56:25,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 05:56:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098372261] [2022-04-15 05:56:25,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098372261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:25,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174260491] [2022-04-15 05:56:25,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:25,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:25,780 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:25,781 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:25,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:25,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:25,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:56:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:25,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:26,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5400#true} is VALID [2022-04-15 05:56:26,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#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(10, 2); {5400#true} is VALID [2022-04-15 05:56:26,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 05:56:26,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 05:56:26,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 05:56:26,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5435#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:26,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {5435#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5435#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:26,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {5435#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:26,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5406#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:26,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:26,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {5407#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5407#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:26,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {5407#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:26,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {5408#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5408#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:26,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {5408#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:26,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {5409#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5409#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:26,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:26,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {5410#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5410#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:26,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:26,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {5411#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 05:56:26,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {5411#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:26,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {5412#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5412#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:26,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {5412#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:26,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {5413#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5413#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:26,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {5413#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:26,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {5414#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5414#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:26,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5415#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {5415#(<= main_~i~0 10)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 05:56:26,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 05:56:26,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 05:56:26,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 05:56:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:26,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:26,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {5401#false} assume !false; {5401#false} is VALID [2022-04-15 05:56:26,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {5401#false} assume 0 == ~cond; {5401#false} is VALID [2022-04-15 05:56:26,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {5401#false} ~cond := #in~cond; {5401#false} is VALID [2022-04-15 05:56:26,432 INFO L272 TraceCheckUtils]: 36: Hoare triple {5401#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {5401#false} assume !(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {5401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {5401#false} assume !!(0 != #t~mem4);havoc #t~mem4; {5401#false} is VALID [2022-04-15 05:56:26,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {5401#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {5401#false} is VALID [2022-04-15 05:56:26,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {5401#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {5401#false} is VALID [2022-04-15 05:56:26,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {5577#(< main_~i~0 1023)} assume !(~i~0 < 1023); {5401#false} is VALID [2022-04-15 05:56:26,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {5581#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5577#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:26,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {5581#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5581#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:26,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {5588#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5581#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:26,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {5588#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5588#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:26,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {5595#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5588#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:26,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {5595#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5595#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:26,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {5602#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5595#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:26,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {5602#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5602#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:26,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {5609#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5602#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:26,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {5609#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5609#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:26,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {5616#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5609#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:26,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {5616#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5616#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:26,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {5623#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5616#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:26,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {5623#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5623#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:26,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {5630#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5623#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:26,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {5630#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5630#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:26,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5630#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:26,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {5637#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5637#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:26,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {5644#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5637#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:26,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {5644#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5644#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:26,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {5400#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5644#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:26,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {5400#true} call #t~ret5 := main(); {5400#true} is VALID [2022-04-15 05:56:26,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5400#true} {5400#true} #58#return; {5400#true} is VALID [2022-04-15 05:56:26,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {5400#true} assume true; {5400#true} is VALID [2022-04-15 05:56:26,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {5400#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(10, 2); {5400#true} is VALID [2022-04-15 05:56:26,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {5400#true} call ULTIMATE.init(); {5400#true} is VALID [2022-04-15 05:56:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174260491] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:26,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:26,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:56:26,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:26,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851229227] [2022-04-15 05:56:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851229227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:26,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:26,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:56:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291696378] [2022-04-15 05:56:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:56:26,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:26,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:26,480 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:26,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:56:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:56:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:56:26,481 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,077 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-04-15 05:56:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:56:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 05:56:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 05:56:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-04-15 05:56:27,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 101 transitions. [2022-04-15 05:56:27,172 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:56:27,173 INFO L225 Difference]: With dead ends: 95 [2022-04-15 05:56:27,173 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 05:56:27,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 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:27,174 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:27,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 31 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 05:56:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2022-04-15 05:56:27,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:27,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,239 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,239 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,241 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-04-15 05:56:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-04-15 05:56:27,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:27,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:27,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 05:56:27,242 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 05:56:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:27,243 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-04-15 05:56:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-04-15 05:56:27,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:27,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:27,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:27,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 05:56:27,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2022-04-15 05:56:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:27,245 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 05:56:27,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:27,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 05:56:27,299 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:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 05:56:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 05:56:27,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:27,300 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:27,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:27,507 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:27,507 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:27,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2031815643, now seen corresponding path program 23 times [2022-04-15 05:56:27,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:27,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890699801] [2022-04-15 05:56:27,512 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,512 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:27,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2031815643, now seen corresponding path program 24 times [2022-04-15 05:56:27,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:27,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347620906] [2022-04-15 05:56:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {6145#(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(10, 2); {6128#true} is VALID [2022-04-15 05:56:27,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 05:56:27,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 05:56:27,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:27,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {6145#(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(10, 2); {6128#true} is VALID [2022-04-15 05:56:27,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 05:56:27,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 05:56:27,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 05:56:27,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6133#(= main_~i~0 0)} is VALID [2022-04-15 05:56:27,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {6133#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6133#(= main_~i~0 0)} is VALID [2022-04-15 05:56:27,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {6133#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {6134#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {6134#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {6135#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {6135#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6136#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {6136#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6136#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {6136#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6137#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {6137#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6137#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {6137#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6138#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {6138#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6138#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {6138#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6139#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {6139#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6139#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {6139#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6140#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {6140#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6140#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {6140#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6141#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {6141#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6141#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {6141#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6142#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {6142#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6142#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {6142#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6143#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {6143#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6143#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {6143#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6144#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {6144#(<= main_~i~0 11)} assume !(~i~0 < 1023); {6129#false} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6129#false} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {6129#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {6129#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6129#false} is VALID [2022-04-15 05:56:27,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {6129#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {6129#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {6129#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {6129#false} assume !(0 != #t~mem4);havoc #t~mem4; {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L272 TraceCheckUtils]: 38: Hoare triple {6129#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {6129#false} ~cond := #in~cond; {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {6129#false} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 05:56:27,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 05:56:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347620906] [2022-04-15 05:56:27,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347620906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631998802] [2022-04-15 05:56:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:27,688 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:27,718 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:27,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:27,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:27,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:27,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6128#true} is VALID [2022-04-15 05:56:27,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#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(10, 2); {6128#true} is VALID [2022-04-15 05:56:27,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:27,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {6128#true} assume !(~i~0 < 1023); {6128#true} is VALID [2022-04-15 05:56:27,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {6128#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6236#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:27,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {6236#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6236#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:27,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {6236#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {6236#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:27,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {6236#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {6134#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6134#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {6134#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {6134#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {6134#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {6135#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6135#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {6135#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {6135#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,948 INFO L272 TraceCheckUtils]: 38: Hoare triple {6135#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:27,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:27,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 05:56:27,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 05:56:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:56:27,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:28,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#false} assume !false; {6129#false} is VALID [2022-04-15 05:56:28,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6129#false} is VALID [2022-04-15 05:56:28,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:28,148 INFO L272 TraceCheckUtils]: 38: Hoare triple {6284#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:28,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {6284#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:28,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {6284#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:28,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {6294#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6284#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:28,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {6294#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:28,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {6294#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:28,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {6304#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6294#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:28,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {6304#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {6304#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {6128#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6304#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {6128#true} assume !(~i~0 < 1023); {6128#true} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {6128#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {6128#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6128#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {6128#true} call #t~ret5 := main(); {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6128#true} {6128#true} #58#return; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {6128#true} assume true; {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#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(10, 2); {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {6128#true} call ULTIMATE.init(); {6128#true} is VALID [2022-04-15 05:56:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:56:28,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631998802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:28,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:28,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-04-15 05:56:28,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:28,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890699801] [2022-04-15 05:56:28,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890699801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:28,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:28,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:56:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351681465] [2022-04-15 05:56:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:28,161 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 05:56:28,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:28,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:28,185 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:28,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:56:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:56:28,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:56:28,187 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:28,806 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-04-15 05:56:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:56:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 05:56:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 05:56:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 05:56:28,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2022-04-15 05:56:28,903 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:56:28,904 INFO L225 Difference]: With dead ends: 101 [2022-04-15 05:56:28,904 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 05:56:28,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 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:28,905 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:28,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 41 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 05:56:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2022-04-15 05:56:28,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:28,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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:28,971 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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:28,971 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:28,973 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-15 05:56:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-04-15 05:56:28,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:28,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:28,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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 87 states. [2022-04-15 05:56:28,974 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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 87 states. [2022-04-15 05:56:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:28,976 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-15 05:56:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-04-15 05:56:28,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:28,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:28,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:28,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 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:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-15 05:56:28,977 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2022-04-15 05:56:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:28,977 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-15 05:56:28,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:28,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-15 05:56:29,029 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:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 05:56:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 05:56:29,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:29,029 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:29,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 05:56:29,230 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:29,230 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash -127058489, now seen corresponding path program 25 times [2022-04-15 05:56:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:29,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711024369] [2022-04-15 05:56:29,234 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:29,234 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:29,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -127058489, now seen corresponding path program 26 times [2022-04-15 05:56:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:29,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325189934] [2022-04-15 05:56:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:29,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {6911#(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(10, 2); {6893#true} is VALID [2022-04-15 05:56:29,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 05:56:29,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 05:56:29,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:29,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {6911#(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(10, 2); {6893#true} is VALID [2022-04-15 05:56:29,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 05:56:29,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 05:56:29,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 05:56:29,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6898#(= main_~i~0 0)} is VALID [2022-04-15 05:56:29,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {6898#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6898#(= main_~i~0 0)} is VALID [2022-04-15 05:56:29,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {6898#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:29,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {6899#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:29,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {6899#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:29,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {6900#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:29,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {6900#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:29,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {6901#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:29,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:29,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:29,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {6902#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:29,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:29,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:29,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {6904#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:29,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:29,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {6905#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:29,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {6905#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:29,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {6906#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:29,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {6906#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:29,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {6907#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:29,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {6907#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:29,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:29,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {6908#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:29,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {6909#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:29,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {6909#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6910#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:29,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {6910#(<= main_~i~0 12)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,400 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 05:56:29,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 05:56:29,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 05:56:29,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 05:56:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:29,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:29,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325189934] [2022-04-15 05:56:29,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325189934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:29,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364444390] [2022-04-15 05:56:29,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:29,403 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:29,431 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:29,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:29,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:29,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 05:56:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:29,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:29,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2022-04-15 05:56:29,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#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(10, 2); {6893#true} is VALID [2022-04-15 05:56:29,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 05:56:29,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 05:56:29,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 05:56:29,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6930#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:29,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {6930#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6930#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:29,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {6930#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:29,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {6899#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6899#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:29,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {6899#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:29,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {6900#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6900#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:29,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {6900#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:29,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {6901#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6901#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:29,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:29,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6902#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:29,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {6902#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:29,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6903#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:29,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:29,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {6904#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6904#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:29,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {6904#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:29,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {6905#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6905#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:29,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {6905#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:29,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {6906#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6906#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:29,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {6906#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:29,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {6907#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6907#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:29,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {6907#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:29,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {6908#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6908#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:29,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {6908#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:29,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {6909#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6909#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:29,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {6909#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6910#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {6910#(<= main_~i~0 12)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:29,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 05:56:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:29,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:30,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#false} assume 0 == ~cond; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#false} ~cond := #in~cond; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L272 TraceCheckUtils]: 40: Hoare triple {6894#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#false} assume !(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {6894#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6894#false} is VALID [2022-04-15 05:56:30,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {6894#false} assume !!(0 != #t~mem4);havoc #t~mem4; {6894#false} is VALID [2022-04-15 05:56:30,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {6894#false} is VALID [2022-04-15 05:56:30,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {6894#false} is VALID [2022-04-15 05:56:30,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {7084#(< main_~i~0 1023)} assume !(~i~0 < 1023); {6894#false} is VALID [2022-04-15 05:56:30,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {7088#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:30,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {7088#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7088#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:30,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {7095#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7088#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:30,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {7095#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7095#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:30,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {7102#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7095#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:30,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {7102#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7102#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:30,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {7109#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7102#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:30,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {7109#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7109#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:30,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {7116#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7109#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:30,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {7116#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7116#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:30,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {7123#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7116#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:30,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {7123#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7123#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:30,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {7130#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7123#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:30,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {7130#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7130#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:30,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {7137#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7130#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:30,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {7137#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7137#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:30,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {7144#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7137#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:30,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7144#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:30,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7151#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7144#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:30,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {7151#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7151#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:30,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7151#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:30,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {7158#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7158#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:30,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {7165#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7158#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:30,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {7165#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7165#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:30,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {6893#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7165#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:30,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret5 := main(); {6893#true} is VALID [2022-04-15 05:56:30,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #58#return; {6893#true} is VALID [2022-04-15 05:56:30,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2022-04-15 05:56:30,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#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(10, 2); {6893#true} is VALID [2022-04-15 05:56:30,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2022-04-15 05:56:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364444390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:30,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:30,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 05:56:30,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711024369] [2022-04-15 05:56:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711024369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:30,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:30,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:56:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551420559] [2022-04-15 05:56:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 05:56:30,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:30,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:30,164 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:30,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:56:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:56:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:56:30,166 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:30,862 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-04-15 05:56:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:56:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 05:56:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2022-04-15 05:56:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2022-04-15 05:56:30,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2022-04-15 05:56:30,966 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 05:56:30,967 INFO L225 Difference]: With dead ends: 107 [2022-04-15 05:56:30,967 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 05:56:30,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 05:56:30,968 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 157 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:30,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 31 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 05:56:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2022-04-15 05:56:31,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:31,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:31,063 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:31,063 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:31,072 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-04-15 05:56:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-04-15 05:56:31,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:31,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:31,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 05:56:31,073 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 05:56:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:31,076 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-04-15 05:56:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-04-15 05:56:31,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:31,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:31,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:31,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 05:56:31,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2022-04-15 05:56:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:31,083 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 05:56:31,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:31,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 05:56:31,137 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:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 05:56:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 05:56:31,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:31,138 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:31,163 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:31,351 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:31,351 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 688498409, now seen corresponding path program 27 times [2022-04-15 05:56:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650684410] [2022-04-15 05:56:31,355 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:31,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:31,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash 688498409, now seen corresponding path program 28 times [2022-04-15 05:56:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:31,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582222651] [2022-04-15 05:56:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:31,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {7728#(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(10, 2); {7709#true} is VALID [2022-04-15 05:56:31,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 05:56:31,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 05:56:31,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:31,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {7728#(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(10, 2); {7709#true} is VALID [2022-04-15 05:56:31,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 05:56:31,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 05:56:31,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 05:56:31,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7714#(= main_~i~0 0)} is VALID [2022-04-15 05:56:31,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {7714#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7714#(= main_~i~0 0)} is VALID [2022-04-15 05:56:31,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {7714#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:31,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {7715#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:31,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:31,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {7716#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:31,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {7716#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:31,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {7717#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:31,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {7717#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:31,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {7718#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:31,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:31,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:31,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {7719#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:31,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:31,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:31,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:31,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:31,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {7722#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:31,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:31,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {7723#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:31,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {7723#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:31,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {7724#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:31,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {7724#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:31,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:31,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {7725#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:31,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {7726#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:31,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {7726#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7727#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:31,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {7727#(<= main_~i~0 13)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 05:56:31,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 05:56:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:31,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:31,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582222651] [2022-04-15 05:56:31,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582222651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:31,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231033395] [2022-04-15 05:56:31,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:31,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:31,568 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:31,568 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:31,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:31,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:56:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:31,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:31,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7709#true} is VALID [2022-04-15 05:56:31,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#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(10, 2); {7709#true} is VALID [2022-04-15 05:56:31,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 05:56:31,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 05:56:31,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 05:56:31,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7747#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:31,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {7747#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7747#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:31,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {7747#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:31,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {7715#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7715#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:31,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {7715#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:31,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {7716#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7716#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:31,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {7716#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:31,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {7717#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7717#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:31,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {7717#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:31,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {7718#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7718#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:31,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:31,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7719#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:31,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {7719#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:31,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7720#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:31,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:31,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7721#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:31,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:31,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {7722#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7722#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:31,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:31,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {7723#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7723#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:31,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {7723#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:31,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {7724#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7724#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:31,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {7724#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:31,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7725#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:31,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {7725#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:31,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {7726#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7726#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {7726#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7727#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {7727#(<= main_~i~0 13)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 05:56:31,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 05:56:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:31,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {7710#false} assume !false; {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {7710#false} assume 0 == ~cond; {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {7710#false} ~cond := #in~cond; {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L272 TraceCheckUtils]: 42: Hoare triple {7710#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {7710#false} assume !(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:32,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {7710#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7710#false} is VALID [2022-04-15 05:56:32,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {7907#(< main_~i~0 1023)} assume !(~i~0 < 1023); {7710#false} is VALID [2022-04-15 05:56:32,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {7911#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7907#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:32,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {7911#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7911#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:32,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {7918#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7911#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:32,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {7918#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7918#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:32,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {7925#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7918#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:32,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {7925#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7925#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:32,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7925#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:32,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {7932#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7932#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:32,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {7939#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7932#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:32,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {7939#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7939#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:32,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {7946#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7939#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:32,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {7946#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7946#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:32,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {7953#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7946#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:32,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {7953#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7953#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:32,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {7960#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7953#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:32,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {7960#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7960#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:32,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {7967#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7960#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:32,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {7967#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7967#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:32,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {7974#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7967#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:32,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7974#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:32,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {7981#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7974#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:32,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {7981#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7981#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:32,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {7988#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7981#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:32,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {7988#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7988#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:32,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {7995#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7988#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:32,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {7995#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7995#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:32,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {7709#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7995#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:32,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {7709#true} call #t~ret5 := main(); {7709#true} is VALID [2022-04-15 05:56:32,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7709#true} {7709#true} #58#return; {7709#true} is VALID [2022-04-15 05:56:32,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {7709#true} assume true; {7709#true} is VALID [2022-04-15 05:56:32,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {7709#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(10, 2); {7709#true} is VALID [2022-04-15 05:56:32,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {7709#true} call ULTIMATE.init(); {7709#true} is VALID [2022-04-15 05:56:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:32,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231033395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:32,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:56:32,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:32,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650684410] [2022-04-15 05:56:32,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650684410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:32,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:32,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:56:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403311015] [2022-04-15 05:56:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 05:56:32,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:32,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:32,400 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:32,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:56:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:56:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:56:32,401 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,345 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-15 05:56:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:56:33,346 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 05:56:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2022-04-15 05:56:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 122 transitions. [2022-04-15 05:56:33,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 122 transitions. [2022-04-15 05:56:33,445 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 05:56:33,446 INFO L225 Difference]: With dead ends: 113 [2022-04-15 05:56:33,446 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 05:56:33,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 79 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:33,447 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 167 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:33,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 36 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 05:56:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 49. [2022-04-15 05:56:33,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:33,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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:33,528 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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:33,529 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,531 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-15 05:56:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-15 05:56:33,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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 99 states. [2022-04-15 05:56:33,531 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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 99 states. [2022-04-15 05:56:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,533 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-15 05:56:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-15 05:56:33,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:33,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 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:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 05:56:33,535 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2022-04-15 05:56:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:33,535 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 05:56:33,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:33,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 05:56:33,589 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:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 05:56:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 05:56:33,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:33,590 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:33,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 05:56:33,790 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:33,791 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1540337781, now seen corresponding path program 29 times [2022-04-15 05:56:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:33,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671644511] [2022-04-15 05:56:33,796 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,796 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:33,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1540337781, now seen corresponding path program 30 times [2022-04-15 05:56:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:33,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54143129] [2022-04-15 05:56:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:34,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {8589#(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(10, 2); {8569#true} is VALID [2022-04-15 05:56:34,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 05:56:34,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 05:56:34,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:34,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {8589#(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(10, 2); {8569#true} is VALID [2022-04-15 05:56:34,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 05:56:34,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 05:56:34,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 05:56:34,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8574#(= main_~i~0 0)} is VALID [2022-04-15 05:56:34,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {8574#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8574#(= main_~i~0 0)} is VALID [2022-04-15 05:56:34,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {8575#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {8575#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {8576#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {8576#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8577#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:34,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {8577#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8577#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:34,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {8577#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8578#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:34,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {8578#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8578#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:34,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {8578#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8579#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:34,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {8579#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8579#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:34,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {8579#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8580#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:34,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {8580#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8580#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:34,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {8580#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8581#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:34,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {8581#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8581#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:34,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {8581#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8582#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:34,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {8582#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8582#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:34,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {8582#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8583#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:34,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {8583#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8583#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:34,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {8583#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8584#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:34,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {8584#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8584#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:34,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {8584#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8585#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:34,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {8585#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8585#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:34,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {8585#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8586#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:34,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {8586#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8586#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:34,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {8586#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:34,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {8587#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8587#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:34,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {8587#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8588#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:34,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {8588#(<= main_~i~0 14)} assume !(~i~0 < 1023); {8570#false} is VALID [2022-04-15 05:56:34,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {8570#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {8570#false} assume !!(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {8570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {8570#false} assume !!(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {8570#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {8570#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {8570#false} assume !(0 != #t~mem4);havoc #t~mem4; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L272 TraceCheckUtils]: 44: Hoare triple {8570#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {8570#false} ~cond := #in~cond; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {8570#false} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 05:56:34,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 05:56:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54143129] [2022-04-15 05:56:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54143129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111614048] [2022-04-15 05:56:34,015 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:34,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:34,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:34,016 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:34,017 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:34,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:34,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:34,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:34,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:34,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#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(10, 2); {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {8569#true} assume !(~i~0 < 1023); {8569#true} is VALID [2022-04-15 05:56:34,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8698#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:34,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {8698#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8698#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:34,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {8698#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {8698#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:34,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {8698#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {8575#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8575#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {8575#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {8575#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {8575#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {8576#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8576#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {8576#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {8576#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,269 INFO L272 TraceCheckUtils]: 44: Hoare triple {8576#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:34,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:34,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 05:56:34,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 05:56:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:56:34,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:34,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {8570#false} assume !false; {8570#false} is VALID [2022-04-15 05:56:34,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {8730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8570#false} is VALID [2022-04-15 05:56:34,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:34,455 INFO L272 TraceCheckUtils]: 44: Hoare triple {8746#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {8726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:34,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {8746#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:34,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {8746#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:34,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {8756#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:34,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {8756#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:34,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {8756#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:34,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {8766#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8756#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:34,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {8766#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:34,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {8766#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {8766#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {8569#true} assume !(~i~0 < 1023); {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {8569#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {8569#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {8569#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {8569#true} call #t~ret5 := main(); {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8569#true} {8569#true} #58#return; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {8569#true} assume true; {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {8569#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(10, 2); {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {8569#true} call ULTIMATE.init(); {8569#true} is VALID [2022-04-15 05:56:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:56:34,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111614048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:34,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 24 [2022-04-15 05:56:34,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:34,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671644511] [2022-04-15 05:56:34,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671644511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:34,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:56:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113424966] [2022-04-15 05:56:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 05:56:34,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:34,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:34,492 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:34,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:56:34,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:34,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:56:34,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:56:34,493 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:35,452 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-04-15 05:56:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:56:35,453 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 05:56:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2022-04-15 05:56:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2022-04-15 05:56:35,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2022-04-15 05:56:35,549 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 05:56:35,551 INFO L225 Difference]: With dead ends: 119 [2022-04-15 05:56:35,551 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 05:56:35,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 91 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:35,552 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 211 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:35,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 31 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 05:56:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 51. [2022-04-15 05:56:35,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:35,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,651 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,651 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:35,653 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-15 05:56:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-15 05:56:35,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:35,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:35,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 05:56:35,654 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 05:56:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:35,656 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-15 05:56:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-15 05:56:35,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:35,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:35,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:35,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 05:56:35,658 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2022-04-15 05:56:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:35,658 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 05:56:35,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:35,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 05:56:35,717 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:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 05:56:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:56:35,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:35,717 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:35,734 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:35,918 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:35,918 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -263235667, now seen corresponding path program 31 times [2022-04-15 05:56:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:35,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831487177] [2022-04-15 05:56:35,928 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:35,928 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:35,928 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -263235667, now seen corresponding path program 32 times [2022-04-15 05:56:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999679371] [2022-04-15 05:56:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 05:56:36,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:56:36,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:56:36,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:36,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 05:56:36,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:56:36,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:56:36,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 05:56:36,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9468#(= main_~i~0 0)} is VALID [2022-04-15 05:56:36,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {9468#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9468#(= main_~i~0 0)} is VALID [2022-04-15 05:56:36,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {9468#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:36,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:36,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:36,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:36,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:36,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:36,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:36,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:36,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:36,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:36,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:36,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:36,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:36,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:36,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:36,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:36,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:36,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:36,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:36,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:36,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:36,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:36,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:36,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:36,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:36,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:36,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:36,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:56:36,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:56:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999679371] [2022-04-15 05:56:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999679371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333229276] [2022-04-15 05:56:36,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:36,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:36,160 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:36,161 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:36,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:36,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:36,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:56:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:36,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:36,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 05:56:36,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 05:56:36,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:56:36,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:56:36,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 05:56:36,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:36,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:36,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:36,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:36,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:36,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:36,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:36,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:36,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:36,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:36,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:36,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:36,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:36,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:36,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:36,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:36,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:36,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:36,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:36,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:36,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:36,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:36,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:36,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:36,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:36,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:36,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:36,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:36,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:36,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:36,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:36,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 05:56:36,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 05:56:36,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:56:36,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:56:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:36,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:37,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:56:37,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:56:37,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L272 TraceCheckUtils]: 46: Hoare triple {9464#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} assume !(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} assume !!(0 != #t~mem4);havoc #t~mem4; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {9464#false} is VALID [2022-04-15 05:56:37,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {9675#(< main_~i~0 1023)} assume !(~i~0 < 1023); {9464#false} is VALID [2022-04-15 05:56:37,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {9679#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:37,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {9679#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9679#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:37,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {9686#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9679#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:37,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {9686#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9686#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:37,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {9693#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9686#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:37,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {9693#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9693#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:37,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {9700#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9693#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:37,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {9700#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9700#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:37,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {9707#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9700#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:37,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {9707#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9707#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:37,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {9714#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9707#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:37,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {9714#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9714#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:37,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {9721#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9714#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:37,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9721#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:37,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {9728#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9721#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:37,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9728#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:37,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {9735#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9728#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:37,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {9735#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9735#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:37,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {9742#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9735#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:37,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {9742#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9742#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:37,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {9749#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9742#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:37,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {9749#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9749#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:37,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {9756#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9749#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:37,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {9756#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9756#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:37,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {9763#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9756#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:37,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {9763#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9763#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:37,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {9770#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9763#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:37,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {9770#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9770#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:37,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {9777#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9770#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:37,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {9777#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9777#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:37,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9777#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:37,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret5 := main(); {9463#true} is VALID [2022-04-15 05:56:37,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:56:37,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:56:37,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9463#true} is VALID [2022-04-15 05:56:37,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 05:56:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:37,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333229276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:37,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:37,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:56:37,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:37,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831487177] [2022-04-15 05:56:37,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831487177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:37,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:37,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:56:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653515030] [2022-04-15 05:56:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:37,069 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:56:37,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:37,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:37,100 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:37,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:56:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:56:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:56:37,101 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:38,150 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 05:56:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:56:38,150 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 05:56:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-15 05:56:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-15 05:56:38,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 136 transitions. [2022-04-15 05:56:38,275 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:38,276 INFO L225 Difference]: With dead ends: 125 [2022-04-15 05:56:38,276 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 05:56:38,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:56:38,278 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 213 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:38,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 26 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 05:56:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 53. [2022-04-15 05:56:38,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:38,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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:38,387 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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:38,388 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:38,390 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-04-15 05:56:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-04-15 05:56:38,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:38,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:38,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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 111 states. [2022-04-15 05:56:38,391 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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 111 states. [2022-04-15 05:56:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:38,397 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-04-15 05:56:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-04-15 05:56:38,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:38,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:38,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:38,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 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:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-15 05:56:38,398 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2022-04-15 05:56:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:38,398 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-15 05:56:38,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:38,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-15 05:56:38,457 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:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 05:56:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 05:56:38,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:38,458 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:38,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 05:56:38,663 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:38,664 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1328750769, now seen corresponding path program 33 times [2022-04-15 05:56:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161913200] [2022-04-15 05:56:38,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:38,668 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:38,668 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1328750769, now seen corresponding path program 34 times [2022-04-15 05:56:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82746838] [2022-04-15 05:56:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:38,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {10433#(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(10, 2); {10411#true} is VALID [2022-04-15 05:56:38,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 05:56:38,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 05:56:38,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:38,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {10433#(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(10, 2); {10411#true} is VALID [2022-04-15 05:56:38,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 05:56:38,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 05:56:38,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 05:56:38,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10416#(= main_~i~0 0)} is VALID [2022-04-15 05:56:38,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {10416#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10416#(= main_~i~0 0)} is VALID [2022-04-15 05:56:38,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {10416#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:38,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:38,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:38,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {10418#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:38,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {10418#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:38,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:38,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {10419#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:38,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {10420#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:38,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {10420#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:38,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:38,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:38,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {10422#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:38,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {10422#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:38,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {10423#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:38,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {10423#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:38,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {10424#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:38,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {10424#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:38,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:38,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:38,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {10426#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:38,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {10426#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:38,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {10427#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:38,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {10427#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:38,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {10428#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:38,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {10428#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:38,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:38,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:38,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {10430#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:38,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {10430#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:38,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {10431#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:38,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {10431#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10432#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:38,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {10432#(<= main_~i~0 16)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 05:56:38,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:38,912 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 05:56:38,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 05:56:38,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 05:56:38,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 05:56:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:38,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82746838] [2022-04-15 05:56:38,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82746838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:38,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079731202] [2022-04-15 05:56:38,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:38,916 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:38,945 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:39,026 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:39,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:39,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:56:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:39,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:39,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10411#true} is VALID [2022-04-15 05:56:39,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#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(10, 2); {10411#true} is VALID [2022-04-15 05:56:39,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 05:56:39,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 05:56:39,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 05:56:39,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10452#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:39,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {10452#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10452#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:39,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {10452#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:39,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10417#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:39,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:39,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {10418#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10418#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:39,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {10418#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:39,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10419#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:39,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {10419#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:39,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {10420#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10420#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:39,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {10420#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:39,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10421#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:39,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:39,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {10422#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10422#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:39,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {10422#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:39,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {10423#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10423#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:39,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {10423#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:39,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {10424#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10424#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:39,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {10424#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:39,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10425#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:39,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:39,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {10426#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10426#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:39,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {10426#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:39,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {10427#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10427#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:39,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {10427#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:39,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {10428#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10428#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:39,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {10428#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:39,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10429#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:39,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:39,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {10430#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10430#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:39,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {10430#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:39,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {10431#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10431#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:39,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {10431#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10432#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {10432#(<= main_~i~0 16)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 05:56:39,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 05:56:39,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 05:56:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:39,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {10412#false} assume !false; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {10412#false} assume 0 == ~cond; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {10412#false} ~cond := #in~cond; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L272 TraceCheckUtils]: 48: Hoare triple {10412#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {10412#false} assume !(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {10412#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10412#false} is VALID [2022-04-15 05:56:39,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {10412#false} assume !!(0 != #t~mem4);havoc #t~mem4; {10412#false} is VALID [2022-04-15 05:56:39,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {10412#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {10412#false} is VALID [2022-04-15 05:56:39,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {10412#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {10412#false} is VALID [2022-04-15 05:56:39,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {10630#(< main_~i~0 1023)} assume !(~i~0 < 1023); {10412#false} is VALID [2022-04-15 05:56:39,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {10634#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10630#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:39,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {10634#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10634#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:39,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {10641#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10634#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:39,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {10641#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10641#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:39,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {10648#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10641#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:39,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {10648#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10648#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:39,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {10655#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10648#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:39,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {10655#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10655#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:39,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {10662#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10655#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:39,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {10662#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10662#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:39,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {10669#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10662#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:39,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {10669#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10669#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:39,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {10676#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10669#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:39,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {10676#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10676#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:39,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {10683#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10676#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:39,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {10683#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10683#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:39,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {10690#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10683#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:39,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {10690#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10690#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:39,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {10697#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10690#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:39,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {10697#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10697#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:39,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {10704#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10697#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:39,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {10704#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -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 1012)} is VALID [2022-04-15 05:56:39,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {10711#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:39,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {10711#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -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 1011)} is VALID [2022-04-15 05:56:39,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {10718#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:39,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {10718#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -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 1010)} is VALID [2022-04-15 05:56:39,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {10725#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10718#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:39,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {10725#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -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 1009)} is VALID [2022-04-15 05:56:39,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {10732#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10725#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:39,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {10732#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -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 1008)} is VALID [2022-04-15 05:56:39,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {10739#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10732#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:39,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {10739#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -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 1007)} is VALID [2022-04-15 05:56:39,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {10411#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10739#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:39,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {10411#true} call #t~ret5 := main(); {10411#true} is VALID [2022-04-15 05:56:39,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10411#true} {10411#true} #58#return; {10411#true} is VALID [2022-04-15 05:56:39,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {10411#true} assume true; {10411#true} is VALID [2022-04-15 05:56:39,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {10411#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(10, 2); {10411#true} is VALID [2022-04-15 05:56:39,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {10411#true} call ULTIMATE.init(); {10411#true} is VALID [2022-04-15 05:56:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:39,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079731202] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:39,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:39,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:56:39,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161913200] [2022-04-15 05:56:39,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161913200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:39,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:39,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:56:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311933239] [2022-04-15 05:56:39,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 05:56:39,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:39,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:39,957 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:39,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:56:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:56:39,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:56:39,958 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:41,019 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2022-04-15 05:56:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:56:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 05:56:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2022-04-15 05:56:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2022-04-15 05:56:41,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 143 transitions. [2022-04-15 05:56:41,123 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 05:56:41,125 INFO L225 Difference]: With dead ends: 131 [2022-04-15 05:56:41,125 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 05:56:41,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 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:41,126 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 189 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:41,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 41 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 05:56:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2022-04-15 05:56:41,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:41,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,235 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,235 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:41,237 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-04-15 05:56:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-04-15 05:56:41,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:41,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:41,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 05:56:41,238 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 05:56:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:41,240 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-04-15 05:56:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-04-15 05:56:41,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:41,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:41,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:41,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 05:56:41,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2022-04-15 05:56:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:41,242 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 05:56:41,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:41,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 05:56:41,311 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:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 05:56:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 05:56:41,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:41,311 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:41,330 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:41,519 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:41,519 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1208419953, now seen corresponding path program 35 times [2022-04-15 05:56:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490844252] [2022-04-15 05:56:41,523 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,523 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:41,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1208419953, now seen corresponding path program 36 times [2022-04-15 05:56:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:41,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136628950] [2022-04-15 05:56:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {11426#(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(10, 2); {11403#true} is VALID [2022-04-15 05:56:41,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 05:56:41,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 05:56:41,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:41,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {11426#(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(10, 2); {11403#true} is VALID [2022-04-15 05:56:41,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 05:56:41,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 05:56:41,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 05:56:41,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11408#(= main_~i~0 0)} is VALID [2022-04-15 05:56:41,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {11408#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11408#(= main_~i~0 0)} is VALID [2022-04-15 05:56:41,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {11408#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {11409#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {11409#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {11410#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {11410#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11411#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:41,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {11411#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11411#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:41,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11412#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:41,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {11412#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11412#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:41,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {11412#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11413#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:41,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {11413#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11413#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:41,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {11413#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11414#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:41,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {11414#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11414#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:41,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11415#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:41,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {11415#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11415#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:41,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {11415#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:41,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {11416#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11416#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:41,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {11416#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11417#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:41,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {11417#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11417#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:41,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {11417#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11418#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:41,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {11418#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11418#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:41,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {11418#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11419#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:41,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {11419#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11419#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:41,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {11419#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11420#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:41,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {11420#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11420#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:41,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {11420#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11421#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:41,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {11421#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11421#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:41,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {11421#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11422#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:41,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {11422#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11422#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:41,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {11422#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11423#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:41,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {11423#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11423#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:41,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {11423#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11424#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:41,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {11424#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11424#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:41,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {11424#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11425#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:41,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {11425#(<= main_~i~0 17)} assume !(~i~0 < 1023); {11404#false} is VALID [2022-04-15 05:56:41,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {11404#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11404#false} is VALID [2022-04-15 05:56:41,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 05:56:41,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {11404#false} assume !!(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {11404#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {11404#false} assume !!(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {11404#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {11404#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {11404#false} assume !(0 != #t~mem4);havoc #t~mem4; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L272 TraceCheckUtils]: 50: Hoare triple {11404#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {11404#false} ~cond := #in~cond; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {11404#false} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 05:56:41,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 05:56:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136628950] [2022-04-15 05:56:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136628950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845517811] [2022-04-15 05:56:41,759 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:41,762 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:41,765 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:41,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:41,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:41,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:42,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#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(10, 2); {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {11403#true} assume !(~i~0 < 1023); {11403#true} is VALID [2022-04-15 05:56:42,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {11403#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11553#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:42,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {11553#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11553#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:42,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {11553#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {11553#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:42,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {11553#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:42,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {11409#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11409#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:42,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {11409#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {11409#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:42,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {11409#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:42,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {11410#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11410#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:42,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {11410#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {11410#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:42,023 INFO L272 TraceCheckUtils]: 50: Hoare triple {11410#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:42,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:42,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {11585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 05:56:42,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 05:56:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:56:42,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:42,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {11404#false} assume !false; {11404#false} is VALID [2022-04-15 05:56:42,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {11585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11404#false} is VALID [2022-04-15 05:56:42,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:42,222 INFO L272 TraceCheckUtils]: 50: Hoare triple {11601#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {11581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:42,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {11601#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:42,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {11601#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:42,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {11611#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11601#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:42,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {11611#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:42,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {11611#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:42,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {11621#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11611#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:42,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {11621#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:42,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {11621#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {11403#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {11621#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {11403#true} assume !(~i~0 < 1023); {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {11403#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {11403#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {11403#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11403#true} is VALID [2022-04-15 05:56:42,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {11403#true} call #t~ret5 := main(); {11403#true} is VALID [2022-04-15 05:56:42,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11403#true} {11403#true} #58#return; {11403#true} is VALID [2022-04-15 05:56:42,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {11403#true} assume true; {11403#true} is VALID [2022-04-15 05:56:42,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {11403#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(10, 2); {11403#true} is VALID [2022-04-15 05:56:42,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {11403#true} call ULTIMATE.init(); {11403#true} is VALID [2022-04-15 05:56:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:56:42,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845517811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:42,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:42,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2022-04-15 05:56:42,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490844252] [2022-04-15 05:56:42,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490844252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:42,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:42,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:56:42,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967860337] [2022-04-15 05:56:42,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:42,229 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 05:56:42,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:42,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:42,261 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:42,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:56:42,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:42,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:56:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2022-04-15 05:56:42,262 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:43,547 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-15 05:56:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:56:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 05:56:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-04-15 05:56:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 150 transitions. [2022-04-15 05:56:43,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 150 transitions. [2022-04-15 05:56:43,675 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 05:56:43,677 INFO L225 Difference]: With dead ends: 137 [2022-04-15 05:56:43,677 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 05:56:43,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 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:43,679 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:43,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 51 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 05:56:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 57. [2022-04-15 05:56:43,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:43,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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:43,843 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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:43,843 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:43,845 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2022-04-15 05:56:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2022-04-15 05:56:43,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:43,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:43,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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 123 states. [2022-04-15 05:56:43,846 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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 123 states. [2022-04-15 05:56:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:43,848 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2022-04-15 05:56:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2022-04-15 05:56:43,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:43,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:43,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:43,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 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:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-15 05:56:43,849 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2022-04-15 05:56:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:43,850 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-15 05:56:43,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:43,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-15 05:56:43,929 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:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 05:56:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 05:56:43,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:43,929 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:43,954 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:44,143 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:44,143 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash -111940333, now seen corresponding path program 37 times [2022-04-15 05:56:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:44,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293326444] [2022-04-15 05:56:44,147 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,147 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:44,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -111940333, now seen corresponding path program 38 times [2022-04-15 05:56:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497383821] [2022-04-15 05:56:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {12450#(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(10, 2); {12426#true} is VALID [2022-04-15 05:56:44,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 05:56:44,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 05:56:44,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:44,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {12450#(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(10, 2); {12426#true} is VALID [2022-04-15 05:56:44,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 05:56:44,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 05:56:44,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 05:56:44,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12431#(= main_~i~0 0)} is VALID [2022-04-15 05:56:44,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {12431#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12431#(= main_~i~0 0)} is VALID [2022-04-15 05:56:44,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {12431#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {12432#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {12432#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {12433#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {12434#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {12434#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {12435#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {12435#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {12436#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {12436#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {12437#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {12437#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {12438#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {12438#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {12440#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {12440#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {12441#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {12441#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {12442#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {12442#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {12443#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {12443#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {12444#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {12444#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {12445#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {12445#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {12446#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {12446#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {12447#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {12448#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {12448#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12449#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {12449#(<= main_~i~0 18)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:44,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 05:56:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497383821] [2022-04-15 05:56:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497383821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80052321] [2022-04-15 05:56:44,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:44,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:44,435 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:44,436 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:44,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:44,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:44,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 05:56:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:44,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2022-04-15 05:56:44,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#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(10, 2); {12426#true} is VALID [2022-04-15 05:56:44,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 05:56:44,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 05:56:44,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 05:56:44,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12469#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:44,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {12469#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12469#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:44,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {12469#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {12432#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12432#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {12432#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {12433#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12433#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {12433#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {12434#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12434#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {12434#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {12435#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12435#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {12435#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {12436#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12436#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {12436#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {12437#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12437#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {12437#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {12438#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12438#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {12438#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12439#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {12440#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12440#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {12440#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {12441#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12441#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {12441#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {12442#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12442#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {12442#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {12443#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12443#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {12443#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {12444#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12444#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {12444#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {12445#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12445#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {12445#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {12446#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12446#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {12446#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12447#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {12447#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {12448#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12448#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {12448#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12449#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {12449#(<= main_~i~0 18)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:44,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:44,851 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 05:56:44,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 05:56:44,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 05:56:44,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 05:56:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:44,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:45,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2022-04-15 05:56:45,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {12427#false} assume 0 == ~cond; {12427#false} is VALID [2022-04-15 05:56:45,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {12427#false} ~cond := #in~cond; {12427#false} is VALID [2022-04-15 05:56:45,503 INFO L272 TraceCheckUtils]: 52: Hoare triple {12427#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12427#false} is VALID [2022-04-15 05:56:45,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {12427#false} assume !(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:45,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {12427#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {12427#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {12427#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {12427#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12427#false} is VALID [2022-04-15 05:56:45,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {12659#(< main_~i~0 1023)} assume !(~i~0 < 1023); {12427#false} is VALID [2022-04-15 05:56:45,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {12663#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12659#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:45,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {12663#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12663#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:45,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {12670#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12663#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:45,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {12670#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12670#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:45,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {12677#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:45,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {12677#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12677#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:45,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {12684#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12677#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:45,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {12684#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12684#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:45,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {12691#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12684#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:45,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {12691#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12691#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:45,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {12698#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12691#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:45,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {12698#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12698#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:45,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {12705#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12698#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:45,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12705#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:45,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {12712#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12705#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:45,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {12712#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12712#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:45,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {12719#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12712#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:45,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {12719#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12719#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:45,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {12726#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12719#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:45,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {12726#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12726#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:45,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {12733#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12726#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:45,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {12733#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12733#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:45,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {12740#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12733#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:45,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {12740#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12740#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:45,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {12747#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12740#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:45,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {12747#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12747#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:45,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {12754#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12747#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:45,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {12754#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12754#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:45,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {12761#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12754#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:45,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {12761#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12761#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:45,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {12768#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12761#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:45,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {12768#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12768#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:45,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {12775#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12768#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:45,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {12775#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12775#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:45,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {12782#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12775#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:45,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {12782#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12782#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:45,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {12426#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12782#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:45,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret5 := main(); {12426#true} is VALID [2022-04-15 05:56:45,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #58#return; {12426#true} is VALID [2022-04-15 05:56:45,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2022-04-15 05:56:45,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {12426#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(10, 2); {12426#true} is VALID [2022-04-15 05:56:45,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2022-04-15 05:56:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:45,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80052321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:45,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:45,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 05:56:45,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:45,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293326444] [2022-04-15 05:56:45,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293326444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:45,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:56:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92155531] [2022-04-15 05:56:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 05:56:45,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:45,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:45,554 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:45,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:56:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:45,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:56:45,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:56:45,555 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:46,922 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-15 05:56:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:56:46,922 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 05:56:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-15 05:56:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2022-04-15 05:56:46,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 157 transitions. [2022-04-15 05:56:47,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:47,042 INFO L225 Difference]: With dead ends: 143 [2022-04-15 05:56:47,043 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 05:56:47,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 05:56:47,044 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:47,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 26 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 05:56:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 59. [2022-04-15 05:56:47,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:47,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:47,172 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:47,172 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:47,174 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2022-04-15 05:56:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-04-15 05:56:47,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:47,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:47,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 05:56:47,175 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 05:56:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:47,177 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2022-04-15 05:56:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-04-15 05:56:47,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:47,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:47,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:47,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 05:56:47,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2022-04-15 05:56:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:47,180 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 05:56:47,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:47,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 05:56:47,251 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:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 05:56:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 05:56:47,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:47,252 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:47,271 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:47,459 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:47,459 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1962822859, now seen corresponding path program 39 times [2022-04-15 05:56:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1082910696] [2022-04-15 05:56:47,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:56:47,465 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:47,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1962822859, now seen corresponding path program 40 times [2022-04-15 05:56:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:47,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352228280] [2022-04-15 05:56:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:47,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:47,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {13531#(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(10, 2); {13506#true} is VALID [2022-04-15 05:56:47,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 05:56:47,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 05:56:47,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:47,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {13531#(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(10, 2); {13506#true} is VALID [2022-04-15 05:56:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 05:56:47,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 05:56:47,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 05:56:47,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13511#(= main_~i~0 0)} is VALID [2022-04-15 05:56:47,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {13511#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13511#(= main_~i~0 0)} is VALID [2022-04-15 05:56:47,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {13511#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:47,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:47,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:47,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {13513#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:47,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {13513#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:47,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {13514#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:47,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {13514#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:47,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {13515#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:47,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {13515#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:47,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {13516#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:47,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {13516#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:47,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {13517#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:47,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {13517#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:47,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {13518#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:47,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {13518#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:47,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {13519#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:47,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:47,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {13520#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:47,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:47,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:47,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:47,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {13522#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:47,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {13522#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:47,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {13523#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:47,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {13523#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:47,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:47,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {13524#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:47,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:47,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:47,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:47,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:47,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {13527#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:47,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:47,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {13528#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:47,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {13528#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:47,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {13529#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {13529#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13530#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {13530#(<= main_~i~0 19)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:47,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 05:56:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352228280] [2022-04-15 05:56:47,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352228280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292434684] [2022-04-15 05:56:47,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:47,755 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:47,755 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:47,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:47,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:47,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:56:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:47,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:48,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2022-04-15 05:56:48,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#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(10, 2); {13506#true} is VALID [2022-04-15 05:56:48,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 05:56:48,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 05:56:48,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 05:56:48,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13550#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:48,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {13550#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13550#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:48,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {13550#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:48,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13512#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:48,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:48,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {13513#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13513#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:48,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {13513#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:48,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {13514#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13514#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:48,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {13514#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:48,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {13515#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13515#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:48,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {13515#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:48,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {13516#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13516#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:48,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {13516#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:48,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {13517#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13517#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:48,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {13517#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:48,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {13518#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13518#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:48,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {13518#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:48,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {13519#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13519#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:48,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:48,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {13520#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13520#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:48,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {13520#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:48,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13521#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:48,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:48,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {13522#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13522#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:48,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {13522#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:48,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {13523#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13523#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:48,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {13523#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:48,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {13524#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13524#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:48,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {13524#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:48,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13525#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:48,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:48,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {13526#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13526#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:48,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {13526#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:48,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {13527#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13527#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:48,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {13527#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:48,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {13528#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13528#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:48,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {13528#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:48,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {13529#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13529#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {13529#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13530#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {13530#(<= main_~i~0 19)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 05:56:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:48,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:48,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2022-04-15 05:56:48,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2022-04-15 05:56:48,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2022-04-15 05:56:48,875 INFO L272 TraceCheckUtils]: 54: Hoare triple {13507#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {13507#false} is VALID [2022-04-15 05:56:48,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {13507#false} assume !(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {13507#false} assume !!(0 != #t~mem4);havoc #t~mem4; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {13507#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {13507#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {13507#false} is VALID [2022-04-15 05:56:48,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {13746#(< main_~i~0 1023)} assume !(~i~0 < 1023); {13507#false} is VALID [2022-04-15 05:56:48,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {13750#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:48,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {13750#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -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 1022)} is VALID [2022-04-15 05:56:48,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {13757#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:48,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {13757#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -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 1021)} is VALID [2022-04-15 05:56:48,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {13764#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:48,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {13764#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13764#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:48,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {13771#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13764#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:48,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {13771#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13771#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:48,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {13778#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13771#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:48,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {13778#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13778#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:48,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {13785#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13778#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:48,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {13785#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13785#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:48,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {13792#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13785#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:48,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {13792#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13792#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:48,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {13799#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13792#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:48,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {13799#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13799#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:48,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {13806#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13799#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:48,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {13806#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13806#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:48,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {13813#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13806#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:48,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {13813#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13813#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:48,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {13820#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13813#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:48,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {13820#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13820#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:48,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {13827#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13820#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:48,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {13827#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13827#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:48,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {13834#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13827#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:48,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {13834#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13834#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:48,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {13841#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13834#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:48,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {13841#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13841#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:48,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {13848#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13841#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:48,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {13848#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13848#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:48,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {13855#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13848#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:48,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {13855#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13855#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:48,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13855#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:48,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {13862#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13862#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:48,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {13869#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13862#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:48,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {13869#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13869#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:48,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {13876#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13869#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:48,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {13876#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13876#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:48,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13876#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:48,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret5 := main(); {13506#true} is VALID [2022-04-15 05:56:48,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #58#return; {13506#true} is VALID [2022-04-15 05:56:48,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2022-04-15 05:56:48,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#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(10, 2); {13506#true} is VALID [2022-04-15 05:56:48,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2022-04-15 05:56:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:48,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292434684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:48,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:48,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 05:56:48,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:48,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1082910696] [2022-04-15 05:56:48,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1082910696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:48,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:48,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:56:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375006608] [2022-04-15 05:56:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 05:56:48,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:48,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:48,926 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:48,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:56:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:56:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:56:48,927 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:50,278 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2022-04-15 05:56:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:56:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 05:56:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-04-15 05:56:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-04-15 05:56:50,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 164 transitions. [2022-04-15 05:56:50,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:50,411 INFO L225 Difference]: With dead ends: 149 [2022-04-15 05:56:50,411 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 05:56:50,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 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:50,412 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 247 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:50,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 36 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 05:56:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 61. [2022-04-15 05:56:50,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:50,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,558 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,558 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:50,560 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 05:56:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 05:56:50,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:50,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:50,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,561 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:50,563 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 05:56:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 05:56:50,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:50,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:50,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:50,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 05:56:50,564 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2022-04-15 05:56:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:50,565 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 05:56:50,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:50,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 05:56:50,650 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:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 05:56:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 05:56:50,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:50,651 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:50,677 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:50,852 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:50,852 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1750497495, now seen corresponding path program 41 times [2022-04-15 05:56:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:50,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670350518] [2022-04-15 05:56:50,856 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:50,857 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:50,857 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1750497495, now seen corresponding path program 42 times [2022-04-15 05:56:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042640322] [2022-04-15 05:56:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:51,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {14656#(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(10, 2); {14630#true} is VALID [2022-04-15 05:56:51,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 05:56:51,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 05:56:51,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:51,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#(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(10, 2); {14630#true} is VALID [2022-04-15 05:56:51,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 05:56:51,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 05:56:51,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 05:56:51,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14635#(= main_~i~0 0)} is VALID [2022-04-15 05:56:51,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {14635#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14635#(= main_~i~0 0)} is VALID [2022-04-15 05:56:51,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {14635#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:51,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {14636#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:51,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {14636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:51,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {14637#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:51,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {14637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:51,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:51,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {14638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:51,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {14639#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:51,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {14639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:51,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {14640#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:51,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {14640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:51,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {14641#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:51,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {14641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:51,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {14642#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:51,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {14642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:51,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {14643#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:51,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {14643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:51,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {14644#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:51,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {14644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:51,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {14645#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:51,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:51,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:51,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {14646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14647#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:51,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {14647#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14647#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:51,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {14647#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14648#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:51,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {14648#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14648#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:51,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {14648#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14649#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:51,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {14649#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14649#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:51,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {14649#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14650#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:51,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {14650#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14650#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:51,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {14650#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14651#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:51,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {14651#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14651#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:51,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {14651#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14652#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:51,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {14652#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14652#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:51,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {14652#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14653#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:51,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {14653#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14653#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:51,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {14653#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14654#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:51,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {14654#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14654#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:51,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {14654#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14655#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:51,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {14655#(<= main_~i~0 20)} assume !(~i~0 < 1023); {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {14631#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {14631#false} assume !!(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {14631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {14631#false} assume !!(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {14631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {14631#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {14631#false} assume !(0 != #t~mem4);havoc #t~mem4; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L272 TraceCheckUtils]: 56: Hoare triple {14631#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {14631#false} ~cond := #in~cond; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {14631#false} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 05:56:51,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 05:56:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:51,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042640322] [2022-04-15 05:56:51,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042640322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:51,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124695759] [2022-04-15 05:56:51,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:51,159 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:51,159 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:51,251 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:51,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:51,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:51,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:51,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#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(10, 2); {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {14630#true} assume !(~i~0 < 1023); {14630#true} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {14630#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14801#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:51,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {14801#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14801#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:51,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {14801#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {14801#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:51,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {14801#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:51,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {14636#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:51,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {14636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:51,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:51,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:51,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {14637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:51,450 INFO L272 TraceCheckUtils]: 56: Hoare triple {14637#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:51,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:51,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {14833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 05:56:51,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 05:56:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:56:51,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:51,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {14631#false} assume !false; {14631#false} is VALID [2022-04-15 05:56:51,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {14833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14631#false} is VALID [2022-04-15 05:56:51,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:51,667 INFO L272 TraceCheckUtils]: 56: Hoare triple {14849#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {14829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:51,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {14849#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:51,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {14849#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:51,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {14859#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14849#(<= main_~i~0 1024)} is VALID [2022-04-15 05:56:51,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {14859#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:51,668 INFO L290 TraceCheckUtils]: 51: Hoare triple {14859#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:51,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {14869#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14859#(<= main_~i~0 1023)} is VALID [2022-04-15 05:56:51,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {14869#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:51,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {14869#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {14630#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {14869#(<= main_~i~0 1022)} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {14630#true} assume !(~i~0 < 1023); {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {14630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {14630#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {14630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14630#true} is VALID [2022-04-15 05:56:51,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {14630#true} call #t~ret5 := main(); {14630#true} is VALID [2022-04-15 05:56:51,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14630#true} {14630#true} #58#return; {14630#true} is VALID [2022-04-15 05:56:51,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {14630#true} assume true; {14630#true} is VALID [2022-04-15 05:56:51,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {14630#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(10, 2); {14630#true} is VALID [2022-04-15 05:56:51,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {14630#true} call ULTIMATE.init(); {14630#true} is VALID [2022-04-15 05:56:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:56:51,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124695759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:51,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:51,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 30 [2022-04-15 05:56:51,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:51,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670350518] [2022-04-15 05:56:51,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670350518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:51,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:51,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:56:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717302661] [2022-04-15 05:56:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:56:51,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:51,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:51,711 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:51,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:56:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:56:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:56:51,712 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:53,209 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-04-15 05:56:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:56:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 05:56:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-04-15 05:56:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-04-15 05:56:53,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 171 transitions. [2022-04-15 05:56:53,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:53,345 INFO L225 Difference]: With dead ends: 155 [2022-04-15 05:56:53,345 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 05:56:53,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 115 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:53,346 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 252 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:53,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 36 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 05:56:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 63. [2022-04-15 05:56:53,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:53,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,500 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,500 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:53,503 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2022-04-15 05:56:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2022-04-15 05:56:53,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:53,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:53,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 05:56:53,504 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 05:56:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:53,506 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2022-04-15 05:56:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2022-04-15 05:56:53,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:53,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:53,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:53,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-04-15 05:56:53,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2022-04-15 05:56:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:53,508 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-04-15 05:56:53,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:53,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 64 transitions. [2022-04-15 05:56:53,607 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:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 05:56:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 05:56:53,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:53,608 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:53,632 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:53,832 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:53,833 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1133534713, now seen corresponding path program 43 times [2022-04-15 05:56:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892431163] [2022-04-15 05:56:53,838 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,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:53,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1133534713, now seen corresponding path program 44 times [2022-04-15 05:56:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:53,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415273752] [2022-04-15 05:56:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:54,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {15809#(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(10, 2); {15782#true} is VALID [2022-04-15 05:56:54,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 05:56:54,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 05:56:54,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:54,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {15809#(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(10, 2); {15782#true} is VALID [2022-04-15 05:56:54,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 05:56:54,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 05:56:54,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 05:56:54,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15787#(= main_~i~0 0)} is VALID [2022-04-15 05:56:54,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {15787#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15787#(= main_~i~0 0)} is VALID [2022-04-15 05:56:54,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {15787#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {15788#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {15788#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {15789#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {15789#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:54,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {15790#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:54,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:54,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:54,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {15791#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:54,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {15792#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:54,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {15792#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:54,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {15793#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:54,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {15793#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:54,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {15794#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:54,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {15794#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:54,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {15795#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:54,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {15795#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:54,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {15796#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:54,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {15796#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:54,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {15797#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:54,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {15797#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:54,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {15798#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:54,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {15798#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:54,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {15799#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:54,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {15799#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:54,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {15800#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:54,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {15800#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:54,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {15801#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:54,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {15801#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:54,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {15802#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:54,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {15802#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:54,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {15803#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:54,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {15803#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:54,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {15804#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:54,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {15804#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:54,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {15805#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:54,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {15805#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:54,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {15806#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:54,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {15806#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:54,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {15807#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:54,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {15807#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15808#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {15808#(<= main_~i~0 21)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,180 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 05:56:54,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 05:56:54,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 05:56:54,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 05:56:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415273752] [2022-04-15 05:56:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415273752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128141532] [2022-04-15 05:56:54,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:54,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:54,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:54,184 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:54,208 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:54,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:54,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:54,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:56:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:54,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:54,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 05:56:54,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#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(10, 2); {15782#true} is VALID [2022-04-15 05:56:54,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 05:56:54,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 05:56:54,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 05:56:54,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15828#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {15828#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15828#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {15828#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {15788#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15788#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {15788#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {15789#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15789#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {15789#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:54,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {15790#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15790#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:54,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:54,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15791#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:54,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {15791#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:54,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {15792#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15792#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:54,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {15792#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:54,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {15793#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15793#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:54,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {15793#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:54,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {15794#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15794#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:54,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {15794#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:54,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {15795#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15795#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:54,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {15795#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:54,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {15796#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15796#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:54,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {15796#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:54,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {15797#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15797#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:54,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {15797#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:54,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {15798#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15798#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:54,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {15798#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:54,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {15799#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15799#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:54,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {15799#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:54,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {15800#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15800#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:54,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {15800#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:54,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {15801#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15801#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:54,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {15801#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:54,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {15802#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15802#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:54,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {15802#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:54,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {15803#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15803#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:54,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {15803#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:54,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {15804#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15804#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:54,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {15804#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:54,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {15805#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15805#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:54,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {15805#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:54,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {15806#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15806#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:54,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {15806#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {15807#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15807#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {15807#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15808#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {15808#(<= main_~i~0 21)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 05:56:54,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 05:56:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:54,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:55,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 05:56:55,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 05:56:55,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 05:56:55,523 INFO L272 TraceCheckUtils]: 58: Hoare triple {15783#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {15783#false} is VALID [2022-04-15 05:56:55,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {15783#false} assume !(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:55,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {15783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {15783#false} assume !!(0 != #t~mem4);havoc #t~mem4; {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {15783#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {15783#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {15783#false} is VALID [2022-04-15 05:56:55,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {16036#(< main_~i~0 1023)} assume !(~i~0 < 1023); {15783#false} is VALID [2022-04-15 05:56:55,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {16040#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16036#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:55,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {16040#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16040#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:55,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {16047#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16040#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:55,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {16047#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16047#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:55,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {16054#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16047#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:55,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {16054#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16054#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:55,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {16061#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16054#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:55,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {16061#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16061#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:55,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {16068#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16061#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:55,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {16068#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16068#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:55,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {16075#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16068#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:55,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {16075#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16075#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:55,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {16082#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16075#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:55,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {16082#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16082#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:55,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {16089#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16082#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:55,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {16089#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16089#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:55,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {16096#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16089#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:55,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {16096#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16096#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:55,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {16103#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16096#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:55,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {16103#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16103#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:55,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {16110#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16103#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:55,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {16110#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16110#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:55,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {16117#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16110#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:55,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {16117#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16117#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:55,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {16124#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16117#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:55,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {16124#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16124#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:55,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {16131#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16124#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:55,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {16131#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16131#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:55,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {16138#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16131#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:55,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {16138#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16138#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:55,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {16145#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16138#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:55,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {16145#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16145#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:55,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {16152#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16145#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:55,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {16152#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16152#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:55,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {16159#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16152#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:55,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {16159#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16159#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:55,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {16166#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16159#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:55,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {16166#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16166#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:55,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {16173#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16166#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:55,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {16173#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -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 1003)} is VALID [2022-04-15 05:56:55,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {16180#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16173#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:55,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {16180#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -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 1002)} is VALID [2022-04-15 05:56:55,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16180#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:55,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret5 := main(); {15782#true} is VALID [2022-04-15 05:56:55,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #58#return; {15782#true} is VALID [2022-04-15 05:56:55,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 05:56:55,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#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(10, 2); {15782#true} is VALID [2022-04-15 05:56:55,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 05:56:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:55,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128141532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:55,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:55,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 05:56:55,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:55,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892431163] [2022-04-15 05:56:55,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892431163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:55,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:55,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 05:56:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963897847] [2022-04-15 05:56:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 05:56:55,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:55,578 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:55,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 05:56:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:55,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 05:56:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:56:55,579 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:57,257 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-04-15 05:56:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 05:56:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 05:56:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2022-04-15 05:56:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 178 transitions. [2022-04-15 05:56:57,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 178 transitions. [2022-04-15 05:56:57,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:57,396 INFO L225 Difference]: With dead ends: 161 [2022-04-15 05:56:57,396 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 05:56:57,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:56:57,398 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:57,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 41 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 05:56:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 65. [2022-04-15 05:56:57,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:57,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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:57,613 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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:57,613 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:57,615 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-04-15 05:56:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2022-04-15 05:56:57,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:57,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:57,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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 147 states. [2022-04-15 05:56:57,616 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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 147 states. [2022-04-15 05:56:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:57,618 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-04-15 05:56:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2022-04-15 05:56:57,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:57,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:57,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:57,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 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:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2022-04-15 05:56:57,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2022-04-15 05:56:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:57,620 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2022-04-15 05:56:57,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:57,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 66 transitions. [2022-04-15 05:56:57,718 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:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 05:56:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 05:56:57,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:57,719 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:57,735 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:57,919 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:57,919 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 937788059, now seen corresponding path program 45 times [2022-04-15 05:56:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017405203] [2022-04-15 05:56:57,923 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,923 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:57,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 937788059, now seen corresponding path program 46 times [2022-04-15 05:56:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:57,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166549865] [2022-04-15 05:56:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:58,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {17022#(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(10, 2); {16994#true} is VALID [2022-04-15 05:56:58,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 05:56:58,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 05:56:58,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {17022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:58,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {17022#(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(10, 2); {16994#true} is VALID [2022-04-15 05:56:58,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 05:56:58,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 05:56:58,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 05:56:58,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16999#(= main_~i~0 0)} is VALID [2022-04-15 05:56:58,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {16999#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16999#(= main_~i~0 0)} is VALID [2022-04-15 05:56:58,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {16999#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {17000#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {17000#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {17001#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {17001#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {17002#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {17002#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {17003#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {17003#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {17004#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {17004#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {17005#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {17005#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {17006#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {17006#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {17007#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {17007#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {17008#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {17008#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {17009#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {17009#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {17010#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {17010#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {17011#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {17011#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {17012#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {17012#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {17013#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {17013#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {17014#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {17014#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {17015#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {17015#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {17016#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {17016#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {17017#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {17017#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {17018#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {17018#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {17019#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {17019#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {17020#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {17020#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {17021#(<= main_~i~0 22)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 05:56:58,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 05:56:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166549865] [2022-04-15 05:56:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166549865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462916949] [2022-04-15 05:56:58,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:58,312 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:58,314 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:58,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:58,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:58,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:56:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:58,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {16994#true} is VALID [2022-04-15 05:56:58,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#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(10, 2); {16994#true} is VALID [2022-04-15 05:56:58,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 05:56:58,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 05:56:58,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 05:56:58,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17041#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:58,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {17041#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17041#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:58,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {17041#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {17000#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17000#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {17000#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {17001#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17001#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {17001#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {17002#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17002#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {17002#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {17003#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17003#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {17003#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {17004#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17004#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {17004#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {17005#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17005#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {17005#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {17006#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17006#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {17006#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {17007#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17007#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {17007#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {17008#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17008#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {17008#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {17009#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17009#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {17009#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {17010#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17010#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {17010#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {17011#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17011#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {17011#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {17012#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17012#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {17012#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {17013#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17013#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {17013#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {17014#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17014#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {17014#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {17015#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17015#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {17015#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {17016#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17016#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {17016#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {17017#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17017#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {17017#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {17018#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17018#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {17018#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {17019#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17019#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {17019#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {17020#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17020#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {17020#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17021#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {17021#(<= main_~i~0 22)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:58,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 05:56:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:58,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {16995#false} assume 0 == ~cond; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {16995#false} ~cond := #in~cond; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L272 TraceCheckUtils]: 60: Hoare triple {16995#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {16995#false} assume !(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:59,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {16995#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16995#false} is VALID [2022-04-15 05:56:59,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {16995#false} assume !!(0 != #t~mem4);havoc #t~mem4; {16995#false} is VALID [2022-04-15 05:56:59,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {16995#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {16995#false} is VALID [2022-04-15 05:56:59,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {16995#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {16995#false} is VALID [2022-04-15 05:56:59,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {17255#(< main_~i~0 1023)} assume !(~i~0 < 1023); {16995#false} is VALID [2022-04-15 05:56:59,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {17259#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17255#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:59,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {17259#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17259#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:59,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {17266#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17259#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:59,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {17266#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17266#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:59,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {17273#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17266#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:59,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {17273#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17273#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:59,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {17280#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17273#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:59,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {17280#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17280#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:59,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {17287#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17280#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:59,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {17287#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17287#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:59,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {17294#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17287#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:59,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {17294#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17294#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:59,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {17301#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17294#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:59,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {17301#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17301#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:59,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {17308#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17301#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:59,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {17308#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17308#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:59,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {17315#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17308#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:59,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {17315#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17315#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:59,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {17322#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17315#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:59,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {17322#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17322#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:59,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {17329#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17322#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:59,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {17329#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17329#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:59,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {17336#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17329#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:59,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {17336#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17336#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:59,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {17343#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17336#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:59,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {17343#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17343#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:59,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {17350#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17343#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:59,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {17350#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17350#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:59,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {17357#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17350#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:59,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {17357#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17357#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:59,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {17364#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17357#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:59,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {17364#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17364#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:59,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {17371#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17364#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:59,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {17371#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17371#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:59,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {17378#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17371#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:59,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {17378#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17378#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:59,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {17385#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17378#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:59,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {17385#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17385#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:59,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {17392#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17385#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:59,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {17392#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17392#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:59,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {17399#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17392#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:59,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {17399#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17399#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:59,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {17406#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17399#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:59,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {17406#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17406#(< main_~i~0 1001)} is VALID [2022-04-15 05:56:59,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {16994#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17406#(< main_~i~0 1001)} is VALID [2022-04-15 05:56:59,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret5 := main(); {16994#true} is VALID [2022-04-15 05:56:59,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #58#return; {16994#true} is VALID [2022-04-15 05:56:59,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2022-04-15 05:56:59,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {16994#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(10, 2); {16994#true} is VALID [2022-04-15 05:56:59,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {16994#true} is VALID [2022-04-15 05:56:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:56:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462916949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:59,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 05:56:59,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017405203] [2022-04-15 05:56:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017405203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:59,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:59,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 05:56:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805365732] [2022-04-15 05:56:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 05:56:59,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:59,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:59,747 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:59,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 05:56:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 05:56:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:56:59,748 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:01,567 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2022-04-15 05:57:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 05:57:01,567 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 05:57:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 185 transitions. [2022-04-15 05:57:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 185 transitions. [2022-04-15 05:57:01,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 185 transitions. [2022-04-15 05:57:01,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:01,726 INFO L225 Difference]: With dead ends: 167 [2022-04-15 05:57:01,726 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 05:57:01,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 05:57:01,728 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 320 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:01,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 31 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 05:57:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 67. [2022-04-15 05:57:01,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:01,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,909 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,909 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:01,911 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2022-04-15 05:57:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2022-04-15 05:57:01,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:01,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:01,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 05:57:01,912 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 05:57:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:01,914 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2022-04-15 05:57:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2022-04-15 05:57:01,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:01,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:01,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:01,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 05:57:01,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2022-04-15 05:57:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:01,916 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 05:57:01,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:01,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 05:57:02,026 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:57:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 05:57:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 05:57:02,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:02,027 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:02,053 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:57:02,240 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:57:02,241 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1803814589, now seen corresponding path program 47 times [2022-04-15 05:57:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:02,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978584970] [2022-04-15 05:57:02,246 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,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:02,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1803814589, now seen corresponding path program 48 times [2022-04-15 05:57:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39115972] [2022-04-15 05:57:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:02,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {18279#(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(10, 2); {18250#true} is VALID [2022-04-15 05:57:02,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 05:57:02,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 05:57:02,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18279#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:02,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {18279#(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(10, 2); {18250#true} is VALID [2022-04-15 05:57:02,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 05:57:02,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 05:57:02,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 05:57:02,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18255#(= main_~i~0 0)} is VALID [2022-04-15 05:57:02,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {18255#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18255#(= main_~i~0 0)} is VALID [2022-04-15 05:57:02,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {18255#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:02,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {18256#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:02,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {18256#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:02,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {18257#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:02,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {18257#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18258#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:02,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {18258#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18258#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:02,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {18258#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18259#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:02,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {18259#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18259#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:02,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {18259#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18260#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:02,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {18260#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18260#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:02,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {18260#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18261#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:02,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {18261#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18261#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:02,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {18261#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18262#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:02,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {18262#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18262#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:02,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {18262#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18263#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:02,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {18263#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18263#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:02,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {18263#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18264#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:02,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {18264#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18264#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:02,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {18264#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18265#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:02,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {18265#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18265#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:02,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {18265#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18266#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:02,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {18266#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18266#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:02,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {18266#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18267#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:02,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18267#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:02,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18268#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:02,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {18268#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18268#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:02,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {18268#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18269#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:02,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {18269#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18269#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:02,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {18269#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18270#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:02,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {18270#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18270#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:02,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {18270#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18271#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:02,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {18271#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18271#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:02,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {18271#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18272#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:02,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18272#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:02,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18273#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:02,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {18273#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18273#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:02,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {18273#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18274#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:02,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {18274#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18274#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:02,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {18274#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18275#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:02,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {18275#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18275#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:02,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {18275#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18276#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:02,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {18276#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18276#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:02,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {18276#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18277#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:02,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {18277#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18277#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:02,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {18277#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18278#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {18278#(<= main_~i~0 23)} assume !(~i~0 < 1023); {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {18251#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {18251#false} assume !!(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {18251#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {18251#false} assume !!(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {18251#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {18251#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {18251#false} assume !(0 != #t~mem4);havoc #t~mem4; {18251#false} is VALID [2022-04-15 05:57:02,664 INFO L272 TraceCheckUtils]: 62: Hoare triple {18251#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18251#false} is VALID [2022-04-15 05:57:02,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {18251#false} ~cond := #in~cond; {18251#false} is VALID [2022-04-15 05:57:02,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {18251#false} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 05:57:02,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 05:57:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:02,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39115972] [2022-04-15 05:57:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39115972] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891892406] [2022-04-15 05:57:02,666 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:02,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:02,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:02,667 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:57:02,668 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:57:02,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:02,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:02,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:02,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:03,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2022-04-15 05:57:03,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#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(10, 2); {18250#true} is VALID [2022-04-15 05:57:03,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 05:57:03,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {18250#true} assume !(~i~0 < 1023); {18250#true} is VALID [2022-04-15 05:57:03,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {18250#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18442#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:03,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {18442#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18442#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:03,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {18442#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {18442#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:03,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {18442#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:03,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {18256#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18256#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:03,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {18256#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {18256#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:03,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {18256#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:03,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {18257#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18257#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:03,019 INFO L290 TraceCheckUtils]: 61: Hoare triple {18257#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {18257#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:03,019 INFO L272 TraceCheckUtils]: 62: Hoare triple {18257#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:03,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:03,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {18474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 05:57:03,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 05:57:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:57:03,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:03,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2022-04-15 05:57:03,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {18474#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18251#false} is VALID [2022-04-15 05:57:03,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:03,266 INFO L272 TraceCheckUtils]: 62: Hoare triple {18490#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {18470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:03,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {18490#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:03,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {18490#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:03,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {18500#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18490#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:03,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {18500#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:03,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {18500#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:03,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {18510#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18500#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:03,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {18510#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:03,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {18510#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:03,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {18250#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {18510#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:03,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {18250#true} assume !(~i~0 < 1023); {18250#true} is VALID [2022-04-15 05:57:03,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {18250#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {18250#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret5 := main(); {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #58#return; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#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(10, 2); {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2022-04-15 05:57:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:57:03,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891892406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:03,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:03,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 33 [2022-04-15 05:57:03,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:03,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978584970] [2022-04-15 05:57:03,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978584970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:03,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:03,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 05:57:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062888584] [2022-04-15 05:57:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 05:57:03,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:03,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:03,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:03,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 05:57:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 05:57:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:57:03,327 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:05,361 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2022-04-15 05:57:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 05:57:05,361 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 05:57:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 192 transitions. [2022-04-15 05:57:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 192 transitions. [2022-04-15 05:57:05,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 192 transitions. [2022-04-15 05:57:05,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:05,526 INFO L225 Difference]: With dead ends: 173 [2022-04-15 05:57:05,526 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 05:57:05,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 127 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:57:05,527 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 318 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:05,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 41 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 05:57:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 69. [2022-04-15 05:57:05,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:05,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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:57:05,740 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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:57:05,740 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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:57:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:05,743 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-04-15 05:57:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-04-15 05:57:05,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:05,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:05,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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 159 states. [2022-04-15 05:57:05,744 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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 159 states. [2022-04-15 05:57:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:05,746 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-04-15 05:57:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-04-15 05:57:05,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:05,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:05,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:05,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 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:57:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-15 05:57:05,748 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2022-04-15 05:57:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:05,749 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-15 05:57:05,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:05,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-15 05:57:05,862 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:57:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 05:57:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 05:57:05,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:05,863 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:05,889 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:57:06,087 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:57:06,087 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 831654495, now seen corresponding path program 49 times [2022-04-15 05:57:06,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:06,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1964962155] [2022-04-15 05:57:06,093 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:06,093 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:06,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash 831654495, now seen corresponding path program 50 times [2022-04-15 05:57:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:06,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866494506] [2022-04-15 05:57:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:06,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {19561#(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(10, 2); {19531#true} is VALID [2022-04-15 05:57:06,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 05:57:06,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 05:57:06,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:06,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {19561#(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(10, 2); {19531#true} is VALID [2022-04-15 05:57:06,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 05:57:06,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 05:57:06,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 05:57:06,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19536#(= main_~i~0 0)} is VALID [2022-04-15 05:57:06,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {19536#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19536#(= main_~i~0 0)} is VALID [2022-04-15 05:57:06,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {19536#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:06,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {19537#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:06,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {19537#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:06,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {19538#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:06,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {19538#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:06,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:06,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {19539#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:06,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {19540#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:06,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {19540#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:06,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {19541#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:06,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {19541#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:06,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {19542#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:06,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {19542#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:06,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {19543#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:06,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {19543#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:06,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {19544#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:06,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {19544#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:06,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {19545#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:06,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {19545#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:06,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {19546#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:06,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {19546#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:06,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {19547#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:06,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {19547#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:06,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {19548#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:06,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {19548#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:06,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {19549#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:06,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {19549#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:06,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {19550#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:06,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {19550#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:06,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {19551#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:06,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {19551#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:06,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {19552#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:06,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {19552#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:06,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {19553#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:06,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {19553#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:06,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {19554#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:06,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {19554#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:06,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {19555#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:06,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {19555#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:06,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {19556#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:06,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {19556#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:06,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {19557#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:06,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {19557#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:06,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {19558#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:06,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {19558#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:06,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {19559#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {19559#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19560#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {19560#(<= main_~i~0 24)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:06,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 05:57:06,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 05:57:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:06,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866494506] [2022-04-15 05:57:06,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866494506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:06,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430932411] [2022-04-15 05:57:06,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:06,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:06,505 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:57:06,507 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:57:06,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:06,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:06,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 05:57:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:06,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:07,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19531#true} is VALID [2022-04-15 05:57:07,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#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(10, 2); {19531#true} is VALID [2022-04-15 05:57:07,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 05:57:07,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 05:57:07,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 05:57:07,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19580#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:07,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {19580#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19580#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:07,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {19580#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:07,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {19537#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19537#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:07,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {19537#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:07,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {19538#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19538#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:07,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {19538#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:07,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {19539#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19539#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:07,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {19539#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:07,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {19540#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19540#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:07,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {19540#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:07,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {19541#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19541#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:07,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {19541#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:07,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {19542#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19542#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:07,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {19542#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:07,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {19543#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19543#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:07,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {19543#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:07,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {19544#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19544#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:07,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {19544#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:07,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {19545#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19545#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:07,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {19545#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:07,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {19546#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19546#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:07,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {19546#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:07,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {19547#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19547#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:07,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {19547#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:07,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {19548#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19548#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:07,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {19548#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:07,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {19549#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19549#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:07,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {19549#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:07,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {19550#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19550#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:07,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {19550#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:07,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {19551#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19551#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:07,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {19551#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:07,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {19552#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19552#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:07,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {19552#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:07,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {19553#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19553#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:07,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {19553#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:07,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {19554#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19554#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:07,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {19554#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:07,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {19555#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19555#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:07,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {19555#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:07,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {19556#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19556#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:07,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {19556#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:07,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {19557#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19557#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:07,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {19557#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:07,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {19558#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19558#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:07,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {19558#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:07,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {19559#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19559#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {19559#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19560#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {19560#(<= main_~i~0 24)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:07,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 05:57:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:07,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {19532#false} assume !false; {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {19532#false} assume 0 == ~cond; {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {19532#false} ~cond := #in~cond; {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L272 TraceCheckUtils]: 64: Hoare triple {19532#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {19532#false} assume !(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:08,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {19532#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {19532#false} assume !!(0 != #t~mem4);havoc #t~mem4; {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {19532#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {19532#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {19532#false} is VALID [2022-04-15 05:57:08,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {19806#(< main_~i~0 1023)} assume !(~i~0 < 1023); {19532#false} is VALID [2022-04-15 05:57:08,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {19810#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19806#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:08,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {19810#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19810#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:08,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {19817#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19810#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:08,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {19817#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19817#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:08,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {19824#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19817#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:08,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {19824#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19824#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:08,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {19831#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19824#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:08,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {19831#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19831#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:08,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {19838#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19831#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:08,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {19838#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19838#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:08,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {19845#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19838#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:08,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {19845#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19845#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:08,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {19852#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19845#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:08,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {19852#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19852#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:08,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {19859#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19852#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:08,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {19859#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19859#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:08,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {19866#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19859#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:08,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {19866#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19866#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:08,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {19873#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19866#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:08,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {19873#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19873#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:08,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {19880#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19873#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:08,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {19880#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19880#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:08,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {19887#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19880#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:08,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {19887#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19887#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:08,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {19894#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19887#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:08,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {19894#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19894#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:08,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {19901#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19894#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:08,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {19901#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19901#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:08,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {19908#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19901#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:08,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {19908#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19908#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:08,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {19915#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19908#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:08,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {19915#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19915#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:08,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {19922#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19915#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:08,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {19922#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19922#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:08,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {19929#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19922#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:08,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {19929#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19929#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:08,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {19936#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19929#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:08,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {19936#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19936#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:08,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {19943#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19936#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:08,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {19943#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19943#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:08,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {19950#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19943#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:08,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {19950#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19950#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:08,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19950#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:08,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {19957#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19957#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:08,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {19964#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19957#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:08,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {19964#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19964#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:08,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {19971#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19964#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:08,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {19971#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19971#(< main_~i~0 999)} is VALID [2022-04-15 05:57:08,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {19531#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19971#(< main_~i~0 999)} is VALID [2022-04-15 05:57:08,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {19531#true} call #t~ret5 := main(); {19531#true} is VALID [2022-04-15 05:57:08,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19531#true} {19531#true} #58#return; {19531#true} is VALID [2022-04-15 05:57:08,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {19531#true} assume true; {19531#true} is VALID [2022-04-15 05:57:08,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {19531#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(10, 2); {19531#true} is VALID [2022-04-15 05:57:08,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {19531#true} call ULTIMATE.init(); {19531#true} is VALID [2022-04-15 05:57:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430932411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:08,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 05:57:08,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1964962155] [2022-04-15 05:57:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1964962155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 05:57:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184095643] [2022-04-15 05:57:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 05:57:08,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:08,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:08,138 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:57:08,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 05:57:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 05:57:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:57:08,140 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:10,286 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2022-04-15 05:57:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 05:57:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 05:57:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 199 transitions. [2022-04-15 05:57:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 199 transitions. [2022-04-15 05:57:10,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 199 transitions. [2022-04-15 05:57:10,466 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:57:10,469 INFO L225 Difference]: With dead ends: 179 [2022-04-15 05:57:10,469 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 05:57:10,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 05:57:10,470 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 394 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:10,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 26 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 05:57:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 71. [2022-04-15 05:57:10,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:10,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,748 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,749 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:10,751 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-04-15 05:57:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2022-04-15 05:57:10,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:10,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:10,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 05:57:10,754 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 05:57:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:10,756 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-04-15 05:57:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2022-04-15 05:57:10,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:10,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:10,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:10,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 05:57:10,758 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2022-04-15 05:57:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:10,759 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 05:57:10,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:10,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 05:57:10,852 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:57:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 05:57:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 05:57:10,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:10,855 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:10,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 05:57:11,063 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:11,064 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1406292607, now seen corresponding path program 51 times [2022-04-15 05:57:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:11,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203299199] [2022-04-15 05:57:11,067 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:11,068 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:11,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1406292607, now seen corresponding path program 52 times [2022-04-15 05:57:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:11,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919667650] [2022-04-15 05:57:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:11,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {20906#(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(10, 2); {20875#true} is VALID [2022-04-15 05:57:11,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 05:57:11,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 05:57:11,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:11,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {20906#(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(10, 2); {20875#true} is VALID [2022-04-15 05:57:11,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 05:57:11,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 05:57:11,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 05:57:11,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20880#(= main_~i~0 0)} is VALID [2022-04-15 05:57:11,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {20880#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20880#(= main_~i~0 0)} is VALID [2022-04-15 05:57:11,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {20880#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:11,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {20881#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:11,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {20881#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:11,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {20882#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:11,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {20882#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:11,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {20883#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:11,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {20883#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:11,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {20884#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:11,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {20884#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:11,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {20885#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:11,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {20885#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:11,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {20886#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:11,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {20886#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:11,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {20887#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:11,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {20887#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:11,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {20888#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:11,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {20888#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:11,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {20889#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:11,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {20889#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:11,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {20890#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:11,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {20890#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:11,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:11,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:11,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:11,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:11,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {20893#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:11,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {20893#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:11,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {20894#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:11,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {20894#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:11,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:11,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:11,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {20896#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:11,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {20896#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:11,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {20897#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:11,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {20897#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:11,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {20898#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:11,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {20898#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:11,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {20899#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:11,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {20899#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:11,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {20900#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:11,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {20900#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:11,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {20901#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:11,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {20901#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:11,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {20902#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:11,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {20902#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:11,479 INFO L290 TraceCheckUtils]: 52: Hoare triple {20903#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:11,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {20903#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:11,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {20904#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:11,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {20904#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20905#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:11,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {20905#(<= main_~i~0 25)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 05:57:11,481 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 05:57:11,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 05:57:11,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 05:57:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:11,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919667650] [2022-04-15 05:57:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919667650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915718491] [2022-04-15 05:57:11,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:11,484 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:11,485 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:11,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:11,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:11,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 05:57:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:11,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:12,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20875#true} is VALID [2022-04-15 05:57:12,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#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(10, 2); {20875#true} is VALID [2022-04-15 05:57:12,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 05:57:12,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 05:57:12,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 05:57:12,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20925#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:12,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {20925#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20925#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:12,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {20925#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:12,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {20881#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20881#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:12,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {20881#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:12,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {20882#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20882#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:12,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {20882#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:12,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {20883#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20883#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:12,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {20883#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:12,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {20884#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20884#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:12,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {20884#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:12,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {20885#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20885#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:12,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {20885#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:12,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {20886#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20886#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:12,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {20886#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:12,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {20887#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20887#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:12,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {20887#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:12,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {20888#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20888#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:12,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {20888#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:12,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {20889#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20889#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:12,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {20889#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:12,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {20890#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20890#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:12,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {20890#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:12,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20891#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:12,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:12,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {20892#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20892#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:12,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {20892#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:12,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {20893#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20893#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:12,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {20893#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:12,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {20894#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20894#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:12,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {20894#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:12,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {20895#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20895#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:12,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {20895#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:12,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {20896#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20896#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:12,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {20896#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:12,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {20897#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20897#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:12,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {20897#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:12,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {20898#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20898#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:12,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {20898#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:12,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {20899#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20899#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:12,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {20899#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:12,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {20900#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20900#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:12,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {20900#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:12,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {20901#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20901#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:12,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {20901#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:12,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {20902#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20902#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:12,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {20902#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:12,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {20903#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20903#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:12,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {20903#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:12,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {20904#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20904#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {20904#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20905#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {20905#(<= main_~i~0 25)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:12,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 05:57:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:12,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:13,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {20876#false} assume !false; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 68: Hoare triple {20876#false} assume 0 == ~cond; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {20876#false} ~cond := #in~cond; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L272 TraceCheckUtils]: 66: Hoare triple {20876#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {20876#false} assume !(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {20876#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {20876#false} assume !!(0 != #t~mem4);havoc #t~mem4; {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {20876#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {20876#false} is VALID [2022-04-15 05:57:13,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {20876#false} is VALID [2022-04-15 05:57:13,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {21157#(< main_~i~0 1023)} assume !(~i~0 < 1023); {20876#false} is VALID [2022-04-15 05:57:13,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {21161#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21157#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:13,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {21161#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21161#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:13,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {21168#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21161#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:13,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {21168#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21168#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:13,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {21175#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21168#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:13,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {21175#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21175#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:13,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {21182#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21175#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:13,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {21182#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21182#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:13,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {21189#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21182#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:13,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {21189#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21189#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:13,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {21196#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21189#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:13,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {21196#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21196#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:13,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {21203#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21196#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:13,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {21203#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21203#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:13,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {21210#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21203#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:13,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {21210#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21210#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:13,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {21217#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21210#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:13,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {21217#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21217#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:13,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {21224#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21217#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:13,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {21224#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21224#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:13,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {21231#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21224#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:13,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {21231#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21231#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:13,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {21238#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21231#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:13,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {21238#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21238#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:13,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {21245#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21238#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:13,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {21245#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21245#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:13,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {21252#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21245#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:13,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {21252#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21252#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:13,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {21259#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21252#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:13,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {21259#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21259#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:13,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {21266#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21259#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:13,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {21266#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21266#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:13,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {21273#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21266#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:13,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {21273#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21273#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:13,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {21280#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21273#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:13,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {21280#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21280#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:13,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {21287#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21280#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:13,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {21287#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21287#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:13,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {21294#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21287#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:13,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {21294#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21294#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:13,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {21301#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21294#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:13,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {21301#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21301#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:13,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {21308#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21301#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:13,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {21308#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21308#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:13,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {21315#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21308#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:13,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {21315#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21315#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:13,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {21322#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21315#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:13,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {21322#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21322#(< main_~i~0 999)} is VALID [2022-04-15 05:57:13,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {21329#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21322#(< main_~i~0 999)} is VALID [2022-04-15 05:57:13,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {21329#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21329#(< main_~i~0 998)} is VALID [2022-04-15 05:57:13,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {20875#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21329#(< main_~i~0 998)} is VALID [2022-04-15 05:57:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {20875#true} call #t~ret5 := main(); {20875#true} is VALID [2022-04-15 05:57:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20875#true} {20875#true} #58#return; {20875#true} is VALID [2022-04-15 05:57:13,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {20875#true} assume true; {20875#true} is VALID [2022-04-15 05:57:13,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {20875#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(10, 2); {20875#true} is VALID [2022-04-15 05:57:13,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {20875#true} call ULTIMATE.init(); {20875#true} is VALID [2022-04-15 05:57:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:13,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915718491] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:13,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:13,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 05:57:13,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:13,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203299199] [2022-04-15 05:57:13,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203299199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:13,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:13,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 05:57:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321156011] [2022-04-15 05:57:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:13,083 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:57:13,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:13,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:13,125 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:57:13,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 05:57:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 05:57:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 05:57:13,126 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:15,422 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2022-04-15 05:57:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 05:57:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 05:57:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 206 transitions. [2022-04-15 05:57:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 206 transitions. [2022-04-15 05:57:15,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 206 transitions. [2022-04-15 05:57:15,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:15,609 INFO L225 Difference]: With dead ends: 185 [2022-04-15 05:57:15,609 INFO L226 Difference]: Without dead ends: 171 [2022-04-15 05:57:15,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:57:15,610 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 370 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:15,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 31 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-15 05:57:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 73. [2022-04-15 05:57:15,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:15,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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:57:15,857 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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:57:15,857 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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:57:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:15,859 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-04-15 05:57:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-04-15 05:57:15,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:15,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:15,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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 171 states. [2022-04-15 05:57:15,860 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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 171 states. [2022-04-15 05:57:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:15,863 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-04-15 05:57:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-04-15 05:57:15,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:15,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:15,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:15,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 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:57:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-04-15 05:57:15,867 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2022-04-15 05:57:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:15,867 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-04-15 05:57:15,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:15,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 74 transitions. [2022-04-15 05:57:15,978 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:57:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 05:57:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 05:57:15,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:15,978 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:15,995 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:16,179 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:16,179 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash -294842333, now seen corresponding path program 53 times [2022-04-15 05:57:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:16,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656120905] [2022-04-15 05:57:16,183 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:16,183 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:16,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash -294842333, now seen corresponding path program 54 times [2022-04-15 05:57:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:16,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369616617] [2022-04-15 05:57:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:16,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {22295#(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(10, 2); {22263#true} is VALID [2022-04-15 05:57:16,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 05:57:16,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 05:57:16,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:16,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {22295#(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(10, 2); {22263#true} is VALID [2022-04-15 05:57:16,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 05:57:16,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 05:57:16,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 05:57:16,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22268#(= main_~i~0 0)} is VALID [2022-04-15 05:57:16,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {22268#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22268#(= main_~i~0 0)} is VALID [2022-04-15 05:57:16,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {22268#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:16,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {22269#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:16,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {22269#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:16,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {22270#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:16,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {22270#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22271#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:16,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {22271#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22271#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:16,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {22271#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22272#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:16,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {22272#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22272#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:16,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {22272#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22273#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:16,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {22273#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22273#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:16,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {22273#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22274#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:16,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {22274#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22274#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:16,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {22274#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22275#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:16,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {22275#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22275#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:16,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {22275#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22276#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:16,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {22276#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22276#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:16,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {22276#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22277#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:16,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {22277#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22277#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:16,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {22277#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22278#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:16,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {22278#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22278#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:16,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {22278#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22279#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:16,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {22279#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22279#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:16,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {22279#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22280#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:16,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {22280#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22280#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:16,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {22280#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22281#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:16,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {22281#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22281#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:16,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {22281#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22282#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:16,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {22282#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22282#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:16,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {22282#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22283#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:16,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {22283#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22283#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:16,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {22283#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22284#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:16,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {22284#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22284#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:16,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {22284#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22285#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:16,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {22285#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22285#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:16,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {22285#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22286#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:16,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {22286#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22286#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:16,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {22286#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22287#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:16,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {22287#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22287#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:16,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {22287#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22288#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:16,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {22288#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22288#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:16,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {22288#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22289#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:16,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {22289#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22289#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:16,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {22289#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22290#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:16,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {22290#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22290#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:16,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {22290#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22291#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:16,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {22291#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22291#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:16,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {22291#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22292#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:16,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {22292#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22292#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:16,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {22292#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22293#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:16,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {22293#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22293#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:16,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {22293#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22294#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {22294#(<= main_~i~0 26)} assume !(~i~0 < 1023); {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {22264#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {22264#false} assume !!(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {22264#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {22264#false} assume !!(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 65: Hoare triple {22264#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 66: Hoare triple {22264#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 67: Hoare triple {22264#false} assume !(0 != #t~mem4);havoc #t~mem4; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L272 TraceCheckUtils]: 68: Hoare triple {22264#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {22264#false} ~cond := #in~cond; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {22264#false} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 05:57:16,578 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 05:57:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369616617] [2022-04-15 05:57:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369616617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488071986] [2022-04-15 05:57:16,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:16,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:16,580 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:16,581 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:16,701 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:16,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:16,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#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(10, 2); {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:16,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {22263#true} assume !(~i~0 < 1023); {22263#true} is VALID [2022-04-15 05:57:16,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {22263#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22476#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:16,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {22476#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22476#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:16,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {22476#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {22476#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:16,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {22476#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:16,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {22269#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22269#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:16,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {22269#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {22269#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:16,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {22269#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:16,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {22270#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22270#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:16,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {22270#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {22270#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:16,926 INFO L272 TraceCheckUtils]: 68: Hoare triple {22270#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:16,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:16,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {22508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 05:57:16,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 05:57:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 05:57:16,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:17,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {22264#false} assume !false; {22264#false} is VALID [2022-04-15 05:57:17,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {22508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22264#false} is VALID [2022-04-15 05:57:17,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:17,141 INFO L272 TraceCheckUtils]: 68: Hoare triple {22524#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {22504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:17,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {22524#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:17,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {22524#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:17,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {22534#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22524#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:17,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {22534#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:17,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {22534#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:17,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {22544#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22534#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:17,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {22544#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {22544#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {22263#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {22544#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {22263#true} assume !(~i~0 < 1023); {22263#true} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {22263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {22263#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {22263#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {22263#true} call #t~ret5 := main(); {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22263#true} {22263#true} #58#return; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {22263#true} assume true; {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#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(10, 2); {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {22263#true} call ULTIMATE.init(); {22263#true} is VALID [2022-04-15 05:57:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 05:57:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488071986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:17,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:17,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 36 [2022-04-15 05:57:17,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656120905] [2022-04-15 05:57:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656120905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:17,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:17,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 05:57:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740058994] [2022-04-15 05:57:17,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 05:57:17,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:17,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:17,194 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:57:17,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 05:57:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 05:57:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=726, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:57:17,195 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:19,556 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2022-04-15 05:57:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 05:57:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 05:57:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 213 transitions. [2022-04-15 05:57:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 213 transitions. [2022-04-15 05:57:19,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 213 transitions. [2022-04-15 05:57:19,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:19,762 INFO L225 Difference]: With dead ends: 191 [2022-04-15 05:57:19,763 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 05:57:19,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 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:19,764 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 324 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:19,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 46 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 05:57:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 75. [2022-04-15 05:57:20,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:20,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:20,091 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:20,092 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:20,095 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2022-04-15 05:57:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2022-04-15 05:57:20,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:20,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:20,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 05:57:20,096 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 05:57:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:20,098 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2022-04-15 05:57:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2022-04-15 05:57:20,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:20,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:20,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:20,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-04-15 05:57:20,100 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2022-04-15 05:57:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:20,101 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-04-15 05:57:20,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:20,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 76 transitions. [2022-04-15 05:57:20,205 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:57:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-04-15 05:57:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 05:57:20,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:20,206 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:20,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:20,411 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:20,412 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1637985723, now seen corresponding path program 55 times [2022-04-15 05:57:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432619057] [2022-04-15 05:57:20,415 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:20,415 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:20,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1637985723, now seen corresponding path program 56 times [2022-04-15 05:57:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220551762] [2022-04-15 05:57:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:20,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {23706#(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(10, 2); {23673#true} is VALID [2022-04-15 05:57:20,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 05:57:20,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 05:57:20,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:20,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {23706#(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(10, 2); {23673#true} is VALID [2022-04-15 05:57:20,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 05:57:20,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 05:57:20,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 05:57:20,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23678#(= main_~i~0 0)} is VALID [2022-04-15 05:57:20,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {23678#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23678#(= main_~i~0 0)} is VALID [2022-04-15 05:57:20,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {23678#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:20,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {23679#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:20,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {23679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:20,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {23680#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:20,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {23680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:20,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {23681#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:20,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {23681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:20,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {23682#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:20,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {23682#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:20,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {23683#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:20,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {23683#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:20,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {23684#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:20,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {23684#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:20,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {23685#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:20,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {23685#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:20,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {23686#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:20,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {23686#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:20,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {23687#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:20,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {23687#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:20,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {23688#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:20,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {23688#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:20,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {23689#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:20,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {23689#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:20,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {23690#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:20,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {23690#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:20,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {23691#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:20,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {23691#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:20,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {23692#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:20,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {23692#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:20,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {23693#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:20,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {23693#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:20,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {23694#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:20,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {23694#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:20,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {23695#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:20,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {23695#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:20,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {23696#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:20,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {23696#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:20,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {23697#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:20,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {23697#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:20,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {23698#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:20,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {23698#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:20,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {23699#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:20,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {23699#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:20,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {23700#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:20,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {23700#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:20,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {23701#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:20,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {23701#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:20,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {23702#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:20,836 INFO L290 TraceCheckUtils]: 55: Hoare triple {23702#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:20,836 INFO L290 TraceCheckUtils]: 56: Hoare triple {23703#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:20,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {23703#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:20,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {23704#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:20,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {23704#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23705#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {23705#(<= main_~i~0 27)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 05:57:20,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 05:57:20,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 05:57:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220551762] [2022-04-15 05:57:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220551762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920293795] [2022-04-15 05:57:20,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:20,846 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:20,846 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:20,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:20,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:20,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:57:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:21,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:21,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23673#true} is VALID [2022-04-15 05:57:21,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#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(10, 2); {23673#true} is VALID [2022-04-15 05:57:21,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 05:57:21,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 05:57:21,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 05:57:21,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23725#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:21,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {23725#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23725#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:21,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {23725#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:21,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {23679#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23679#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:21,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {23679#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:21,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {23680#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23680#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:21,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {23680#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:21,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {23681#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23681#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:21,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {23681#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:21,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {23682#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23682#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:21,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {23682#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:21,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {23683#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23683#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:21,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {23683#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:21,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {23684#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23684#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:21,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {23684#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:21,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {23685#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23685#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:21,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {23685#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:21,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {23686#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23686#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:21,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {23686#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:21,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {23687#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23687#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:21,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {23687#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:21,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {23688#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23688#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:21,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {23688#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:21,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {23689#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23689#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:21,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {23689#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:21,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {23690#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23690#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:21,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {23690#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:21,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {23691#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23691#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:21,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {23691#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:21,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {23692#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23692#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:21,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {23692#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:21,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {23693#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23693#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:21,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {23693#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:21,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {23694#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23694#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:21,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {23694#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:21,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {23695#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23695#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:21,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {23695#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:21,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {23696#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23696#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:21,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {23696#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:21,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {23697#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23697#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:21,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {23697#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:21,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {23698#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23698#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:21,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {23698#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:21,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {23699#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23699#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:21,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {23699#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:21,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {23700#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23700#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:21,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {23700#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:21,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {23701#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23701#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:21,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {23701#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:21,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {23702#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23702#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:21,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {23702#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:21,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {23703#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23703#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:21,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {23703#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:21,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {23704#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23704#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {23704#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23705#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {23705#(<= main_~i~0 27)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:21,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 05:57:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:21,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:22,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {23674#false} assume !false; {23674#false} is VALID [2022-04-15 05:57:22,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {23674#false} assume 0 == ~cond; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 71: Hoare triple {23674#false} ~cond := #in~cond; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L272 TraceCheckUtils]: 70: Hoare triple {23674#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {23674#false} assume !(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {23674#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {23674#false} assume !!(0 != #t~mem4);havoc #t~mem4; {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {23674#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {23674#false} is VALID [2022-04-15 05:57:22,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {23674#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {23674#false} is VALID [2022-04-15 05:57:22,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {23969#(< main_~i~0 1023)} assume !(~i~0 < 1023); {23674#false} is VALID [2022-04-15 05:57:22,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {23973#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23969#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:22,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {23973#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23973#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:22,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {23980#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23973#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:22,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {23980#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23980#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:22,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {23987#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23980#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:22,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {23987#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23987#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:22,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {23994#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23987#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:22,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {23994#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23994#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:22,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {24001#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23994#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:22,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {24001#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24001#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:22,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {24008#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24001#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:22,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {24008#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24008#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:22,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {24015#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24008#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:22,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {24015#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24015#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:22,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {24022#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24015#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:22,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {24022#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24022#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:22,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {24029#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24022#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:22,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {24029#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24029#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:22,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {24036#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24029#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:22,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {24036#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24036#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:22,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {24043#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24036#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:22,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {24043#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24043#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:22,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {24050#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24043#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:22,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {24050#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24050#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:22,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {24057#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24050#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:22,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {24057#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24057#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:22,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {24064#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24057#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:22,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {24064#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24064#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:22,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {24071#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24064#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:22,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {24071#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24071#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:22,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {24078#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24071#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:22,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {24078#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24078#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:22,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {24085#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24078#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:22,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {24085#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24085#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:22,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {24092#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24085#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:22,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {24092#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24092#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:22,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {24099#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24092#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:22,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {24099#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24099#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:22,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {24106#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24099#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:22,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {24106#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24106#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:22,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {24113#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24106#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:22,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {24113#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24113#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:22,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {24120#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24113#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:22,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {24120#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24120#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:22,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {24127#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24120#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:22,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {24127#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24127#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:22,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {24134#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24127#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:22,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {24134#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24134#(< main_~i~0 999)} is VALID [2022-04-15 05:57:22,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {24141#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24134#(< main_~i~0 999)} is VALID [2022-04-15 05:57:22,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {24141#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24141#(< main_~i~0 998)} is VALID [2022-04-15 05:57:22,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {24148#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24141#(< main_~i~0 998)} is VALID [2022-04-15 05:57:22,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {24148#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24148#(< main_~i~0 997)} is VALID [2022-04-15 05:57:22,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {24155#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24148#(< main_~i~0 997)} is VALID [2022-04-15 05:57:22,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {24155#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24155#(< main_~i~0 996)} is VALID [2022-04-15 05:57:22,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {23673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24155#(< main_~i~0 996)} is VALID [2022-04-15 05:57:22,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {23673#true} call #t~ret5 := main(); {23673#true} is VALID [2022-04-15 05:57:22,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23673#true} {23673#true} #58#return; {23673#true} is VALID [2022-04-15 05:57:22,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {23673#true} assume true; {23673#true} is VALID [2022-04-15 05:57:22,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {23673#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(10, 2); {23673#true} is VALID [2022-04-15 05:57:22,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {23673#true} call ULTIMATE.init(); {23673#true} is VALID [2022-04-15 05:57:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:22,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920293795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:22,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:22,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 05:57:22,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:22,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432619057] [2022-04-15 05:57:22,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432619057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:22,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:22,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 05:57:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990012057] [2022-04-15 05:57:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 05:57:22,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:22,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:22,623 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:57:22,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 05:57:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 05:57:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:57:22,625 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:25,200 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2022-04-15 05:57:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 05:57:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 05:57:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 220 transitions. [2022-04-15 05:57:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 220 transitions. [2022-04-15 05:57:25,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 220 transitions. [2022-04-15 05:57:25,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:25,368 INFO L225 Difference]: With dead ends: 197 [2022-04-15 05:57:25,368 INFO L226 Difference]: Without dead ends: 183 [2022-04-15 05:57:25,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 121 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:25,369 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 410 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:25,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 41 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-15 05:57:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 77. [2022-04-15 05:57:25,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:25,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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:25,616 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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:25,617 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:25,619 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-04-15 05:57:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-04-15 05:57:25,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:25,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:25,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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 183 states. [2022-04-15 05:57:25,620 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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 183 states. [2022-04-15 05:57:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:25,623 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-04-15 05:57:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-04-15 05:57:25,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:25,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:25,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:25,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 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:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-15 05:57:25,625 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2022-04-15 05:57:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:25,625 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-15 05:57:25,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:25,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-15 05:57:25,749 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:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 05:57:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 05:57:25,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:25,750 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:25,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 05:57:25,952 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:25,952 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 386372583, now seen corresponding path program 57 times [2022-04-15 05:57:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:25,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579669672] [2022-04-15 05:57:25,956 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,956 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:25,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash 386372583, now seen corresponding path program 58 times [2022-04-15 05:57:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:25,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188501009] [2022-04-15 05:57:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:26,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {25183#(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(10, 2); {25149#true} is VALID [2022-04-15 05:57:26,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 05:57:26,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 05:57:26,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:26,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {25183#(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(10, 2); {25149#true} is VALID [2022-04-15 05:57:26,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 05:57:26,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 05:57:26,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 05:57:26,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25154#(= main_~i~0 0)} is VALID [2022-04-15 05:57:26,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {25154#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25154#(= main_~i~0 0)} is VALID [2022-04-15 05:57:26,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {25154#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {25156#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:26,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {25157#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:26,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {25157#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:26,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {25158#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:26,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {25158#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:26,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {25159#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:26,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {25159#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:26,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {25160#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:26,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {25160#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:26,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {25161#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:26,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {25161#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:26,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {25162#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:26,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:26,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:26,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:26,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {25164#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:26,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {25164#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:26,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {25165#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:26,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {25165#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:26,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {25166#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:26,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {25166#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:26,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {25167#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:26,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {25167#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:26,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {25168#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:26,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {25168#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:26,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {25169#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:26,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {25169#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:26,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {25170#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:26,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {25170#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:26,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {25171#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:26,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {25171#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:26,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {25172#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:26,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {25172#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:26,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {25173#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:26,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {25173#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:26,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {25174#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:26,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {25174#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:26,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {25175#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:26,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {25175#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:26,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {25176#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:26,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {25176#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:26,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:26,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:26,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {25178#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:26,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {25178#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:26,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {25179#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:26,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {25179#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:26,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {25180#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:26,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {25180#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:26,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {25181#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {25181#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25182#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {25182#(<= main_~i~0 28)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:26,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 05:57:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188501009] [2022-04-15 05:57:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188501009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902059245] [2022-04-15 05:57:26,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:26,411 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:26,412 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:26,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:26,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:26,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:57:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:26,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:26,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25149#true} is VALID [2022-04-15 05:57:26,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#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(10, 2); {25149#true} is VALID [2022-04-15 05:57:26,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 05:57:26,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 05:57:26,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 05:57:26,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25202#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {25202#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25202#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {25202#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {25155#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25155#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {25155#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25156#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {25156#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:26,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {25157#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25157#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:26,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {25157#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:26,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {25158#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25158#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:26,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {25158#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:26,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {25159#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25159#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:26,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {25159#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:26,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {25160#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25160#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:26,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {25160#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:26,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {25161#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25161#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:26,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {25161#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:26,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {25162#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25162#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:26,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:26,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25163#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:26,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {25163#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:26,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {25164#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25164#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:26,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {25164#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:26,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {25165#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25165#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:26,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {25165#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:26,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {25166#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25166#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:26,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {25166#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:26,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {25167#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25167#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:26,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {25167#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:26,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {25168#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25168#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:26,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {25168#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:26,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {25169#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25169#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:26,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {25169#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:26,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {25170#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25170#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:26,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {25170#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:26,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {25171#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25171#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:26,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {25171#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:26,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {25172#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25172#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:26,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {25172#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:26,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {25173#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25173#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:26,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {25173#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:26,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {25174#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25174#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:26,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {25174#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:26,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {25175#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25175#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:26,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {25175#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:26,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {25176#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25176#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:26,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {25176#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:26,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25177#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:26,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:26,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {25178#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25178#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:26,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {25178#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:26,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {25179#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25179#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:26,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {25179#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:26,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {25180#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25180#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:26,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {25180#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:26,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {25181#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25181#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:26,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {25181#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25182#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {25182#(<= main_~i~0 28)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 05:57:26,986 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 05:57:26,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 05:57:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:26,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:28,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {25150#false} assume !false; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {25150#false} assume 0 == ~cond; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {25150#false} ~cond := #in~cond; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L272 TraceCheckUtils]: 72: Hoare triple {25150#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {25150#false} assume !(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {25150#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {25150#false} assume !!(0 != #t~mem4);havoc #t~mem4; {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {25150#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {25150#false} is VALID [2022-04-15 05:57:28,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {25150#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {25150#false} is VALID [2022-04-15 05:57:28,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {25452#(< main_~i~0 1023)} assume !(~i~0 < 1023); {25150#false} is VALID [2022-04-15 05:57:28,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {25456#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25452#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:28,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {25456#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25456#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:28,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {25463#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25456#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:28,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {25463#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25463#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:28,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {25470#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25463#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:28,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {25470#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25470#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:28,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {25477#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25470#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:28,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {25477#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25477#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:28,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {25484#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25477#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:28,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {25484#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25484#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:28,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {25491#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25484#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:28,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {25491#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25491#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:28,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {25498#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25491#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:28,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {25498#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25498#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:28,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {25505#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25498#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:28,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {25505#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25505#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:28,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25505#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:28,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {25512#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25512#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:28,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {25519#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25512#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:28,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {25519#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25519#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:28,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {25526#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25519#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:28,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {25526#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25526#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:28,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {25533#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25526#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:28,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {25533#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25533#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:28,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {25540#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25533#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:28,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {25540#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25540#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:28,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {25547#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25540#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:28,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {25547#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25547#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:28,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {25554#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25547#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:28,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {25554#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25554#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:28,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {25561#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25554#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:28,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {25561#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25561#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:28,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {25568#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25561#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:28,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {25568#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25568#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:28,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {25575#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25568#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:28,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {25575#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25575#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:28,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {25582#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25575#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:28,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {25582#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25582#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:28,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25582#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:28,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25589#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:28,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {25596#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25589#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:28,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {25596#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25596#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:28,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {25603#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25596#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:28,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {25603#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25603#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:28,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {25610#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25603#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:28,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {25610#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25610#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:28,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {25617#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25610#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:28,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {25617#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25617#(< main_~i~0 999)} is VALID [2022-04-15 05:57:28,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {25624#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25617#(< main_~i~0 999)} is VALID [2022-04-15 05:57:28,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {25624#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25624#(< main_~i~0 998)} is VALID [2022-04-15 05:57:28,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {25631#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25624#(< main_~i~0 998)} is VALID [2022-04-15 05:57:28,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {25631#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25631#(< main_~i~0 997)} is VALID [2022-04-15 05:57:28,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {25638#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25631#(< main_~i~0 997)} is VALID [2022-04-15 05:57:28,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {25638#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25638#(< main_~i~0 996)} is VALID [2022-04-15 05:57:28,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {25645#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25638#(< main_~i~0 996)} is VALID [2022-04-15 05:57:28,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {25645#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {25645#(< main_~i~0 995)} is VALID [2022-04-15 05:57:28,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {25149#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {25645#(< main_~i~0 995)} is VALID [2022-04-15 05:57:28,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {25149#true} call #t~ret5 := main(); {25149#true} is VALID [2022-04-15 05:57:28,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25149#true} {25149#true} #58#return; {25149#true} is VALID [2022-04-15 05:57:28,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {25149#true} assume true; {25149#true} is VALID [2022-04-15 05:57:28,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {25149#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(10, 2); {25149#true} is VALID [2022-04-15 05:57:28,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {25149#true} call ULTIMATE.init(); {25149#true} is VALID [2022-04-15 05:57:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:28,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902059245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:28,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:28,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 05:57:28,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579669672] [2022-04-15 05:57:28,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579669672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:28,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:28,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 05:57:28,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472848024] [2022-04-15 05:57:28,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 05:57:28,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:28,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:28,302 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:57:28,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 05:57:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 05:57:28,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 05:57:28,304 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:31,147 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2022-04-15 05:57:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 05:57:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 05:57:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 227 transitions. [2022-04-15 05:57:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 227 transitions. [2022-04-15 05:57:31,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 227 transitions. [2022-04-15 05:57:31,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:31,312 INFO L225 Difference]: With dead ends: 203 [2022-04-15 05:57:31,312 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 05:57:31,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 124 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:31,314 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 350 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:31,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 56 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 05:57:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 79. [2022-04-15 05:57:31,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:31,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,582 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,582 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:31,585 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-04-15 05:57:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2022-04-15 05:57:31,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:31,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:31,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-15 05:57:31,592 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-15 05:57:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:31,594 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2022-04-15 05:57:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2022-04-15 05:57:31,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:31,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:31,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:31,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 05:57:31,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2022-04-15 05:57:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:31,597 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 05:57:31,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:31,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 05:57:31,734 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:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 05:57:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 05:57:31,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:31,735 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:31,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 05:57:31,935 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:31,935 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 174519561, now seen corresponding path program 59 times [2022-04-15 05:57:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:31,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305799563] [2022-04-15 05:57:31,939 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:31,939 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:31,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash 174519561, now seen corresponding path program 60 times [2022-04-15 05:57:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:31,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321789483] [2022-04-15 05:57:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:31,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:32,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {26704#(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(10, 2); {26669#true} is VALID [2022-04-15 05:57:32,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 05:57:32,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 05:57:32,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:32,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {26704#(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(10, 2); {26669#true} is VALID [2022-04-15 05:57:32,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 05:57:32,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 05:57:32,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 05:57:32,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26674#(= main_~i~0 0)} is VALID [2022-04-15 05:57:32,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {26674#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26674#(= main_~i~0 0)} is VALID [2022-04-15 05:57:32,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {26674#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:32,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {26675#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:32,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {26675#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:32,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {26676#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:32,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {26676#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26677#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:32,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {26677#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26677#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:32,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {26677#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26678#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:32,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {26678#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26678#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:32,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {26678#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26679#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:32,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {26679#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26679#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:32,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {26679#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26680#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:32,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {26680#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26680#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:32,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {26680#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26681#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:32,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {26681#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26681#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:32,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {26681#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26682#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:32,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {26682#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26682#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:32,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {26682#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26683#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:32,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {26683#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26683#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:32,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {26683#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26684#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:32,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {26684#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26684#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:32,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {26684#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26685#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:32,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {26685#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26685#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:32,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {26685#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26686#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:32,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {26686#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26686#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:32,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {26686#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26687#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:32,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {26687#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26687#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:32,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {26687#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26688#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:32,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {26688#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26688#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:32,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {26688#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26689#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:32,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {26689#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26689#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:32,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {26689#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26690#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:32,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {26690#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26690#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:32,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {26690#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26691#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:32,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {26691#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26691#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:32,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {26691#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26692#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:32,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {26692#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26692#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:32,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {26692#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26693#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:32,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {26693#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26693#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:32,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {26693#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26694#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:32,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {26694#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26694#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:32,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {26694#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26695#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:32,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {26695#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26695#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:32,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {26695#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26696#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:32,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {26696#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26696#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:32,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {26696#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26697#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:32,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {26697#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26697#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:32,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {26697#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26698#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:32,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {26698#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26698#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:32,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {26698#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26699#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:32,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {26699#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26699#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:32,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {26699#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26700#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:32,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {26700#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26700#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:32,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {26700#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26701#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:32,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {26701#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26701#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:32,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {26701#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26702#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:32,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {26702#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26702#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:32,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {26702#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26703#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {26703#(<= main_~i~0 29)} assume !(~i~0 < 1023); {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {26670#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {26670#false} assume !!(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {26670#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {26670#false} assume !!(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {26670#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {26670#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {26670#false} assume !(0 != #t~mem4);havoc #t~mem4; {26670#false} is VALID [2022-04-15 05:57:32,389 INFO L272 TraceCheckUtils]: 74: Hoare triple {26670#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26670#false} is VALID [2022-04-15 05:57:32,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {26670#false} ~cond := #in~cond; {26670#false} is VALID [2022-04-15 05:57:32,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {26670#false} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 05:57:32,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 05:57:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:32,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321789483] [2022-04-15 05:57:32,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321789483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:32,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036291489] [2022-04-15 05:57:32,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:32,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:32,392 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:32,393 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:32,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:32,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:32,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:32,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:32,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26669#true} is VALID [2022-04-15 05:57:32,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#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(10, 2); {26669#true} is VALID [2022-04-15 05:57:32,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 05:57:32,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 05:57:32,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {26669#true} assume !(~i~0 < 1023); {26669#true} is VALID [2022-04-15 05:57:32,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {26669#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26903#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:32,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {26903#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26903#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:32,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {26903#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {26903#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:32,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {26903#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:32,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {26675#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26675#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:32,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {26675#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {26675#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:32,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {26675#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:32,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {26676#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26676#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:32,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {26676#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {26676#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:32,761 INFO L272 TraceCheckUtils]: 74: Hoare triple {26676#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:32,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:32,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {26935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 05:57:32,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 05:57:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 05:57:32,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:32,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {26670#false} assume !false; {26670#false} is VALID [2022-04-15 05:57:32,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {26935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26670#false} is VALID [2022-04-15 05:57:32,991 INFO L290 TraceCheckUtils]: 75: Hoare triple {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:32,991 INFO L272 TraceCheckUtils]: 74: Hoare triple {26951#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {26931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:32,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {26951#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:32,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {26951#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:32,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {26961#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26951#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:32,992 INFO L290 TraceCheckUtils]: 70: Hoare triple {26961#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:32,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {26961#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:32,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {26971#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26961#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:32,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {26971#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {26971#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {26669#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {26971#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {26669#true} assume !(~i~0 < 1023); {26669#true} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {26669#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {26669#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {26669#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {26669#true} call #t~ret5 := main(); {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26669#true} {26669#true} #58#return; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {26669#true} assume true; {26669#true} is VALID [2022-04-15 05:57:32,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {26669#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(10, 2); {26669#true} is VALID [2022-04-15 05:57:33,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {26669#true} call ULTIMATE.init(); {26669#true} is VALID [2022-04-15 05:57:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 05:57:33,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036291489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:33,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:33,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7, 7] total 39 [2022-04-15 05:57:33,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:33,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305799563] [2022-04-15 05:57:33,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305799563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:33,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:33,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 05:57:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678730683] [2022-04-15 05:57:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 05:57:33,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:33,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:33,050 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:57:33,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 05:57:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 05:57:33,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=846, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 05:57:33,051 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:35,926 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2022-04-15 05:57:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 05:57:35,926 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 05:57:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 234 transitions. [2022-04-15 05:57:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 234 transitions. [2022-04-15 05:57:35,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 234 transitions. [2022-04-15 05:57:36,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:36,105 INFO L225 Difference]: With dead ends: 209 [2022-04-15 05:57:36,105 INFO L226 Difference]: Without dead ends: 195 [2022-04-15 05:57:36,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1717, Invalid=2975, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 05:57:36,106 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 402 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:36,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 41 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-04-15 05:57:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 81. [2022-04-15 05:57:36,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:36,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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:36,383 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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:36,383 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:36,385 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2022-04-15 05:57:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2022-04-15 05:57:36,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:36,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:36,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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 195 states. [2022-04-15 05:57:36,385 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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 195 states. [2022-04-15 05:57:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:36,387 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2022-04-15 05:57:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2022-04-15 05:57:36,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:36,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:36,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:36,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 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:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-04-15 05:57:36,389 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2022-04-15 05:57:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:36,389 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-04-15 05:57:36,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:36,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 82 transitions. [2022-04-15 05:57:36,500 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:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 05:57:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 05:57:36,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:36,501 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:36,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 05:57:36,701 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:36,701 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1552771669, now seen corresponding path program 61 times [2022-04-15 05:57:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:36,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328657896] [2022-04-15 05:57:36,707 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:36,707 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:36,707 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1552771669, now seen corresponding path program 62 times [2022-04-15 05:57:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:36,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947498423] [2022-04-15 05:57:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:37,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {28244#(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(10, 2); {28208#true} is VALID [2022-04-15 05:57:37,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 05:57:37,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 05:57:37,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:37,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {28244#(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(10, 2); {28208#true} is VALID [2022-04-15 05:57:37,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 05:57:37,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 05:57:37,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 05:57:37,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28213#(= main_~i~0 0)} is VALID [2022-04-15 05:57:37,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {28213#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28213#(= main_~i~0 0)} is VALID [2022-04-15 05:57:37,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {28213#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:37,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {28214#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 05:57:37,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {28214#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:37,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {28215#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:37,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {28215#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:37,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {28216#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:37,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {28216#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:37,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {28217#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:37,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {28217#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:37,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {28218#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:37,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {28218#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:37,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {28219#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:37,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {28219#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:37,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {28220#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:37,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {28220#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:37,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {28221#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 05:57:37,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {28221#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:37,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {28222#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:37,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {28222#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:37,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {28223#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:37,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {28223#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:37,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {28224#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:37,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {28224#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:37,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {28225#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:37,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {28225#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:37,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {28226#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:37,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {28226#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:37,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {28227#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:37,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {28227#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:37,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {28228#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 05:57:37,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {28228#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:37,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {28229#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:37,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {28229#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:37,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {28230#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:37,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {28230#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:37,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {28231#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:37,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {28231#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:37,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {28232#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:37,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {28232#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:37,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {28233#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:37,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {28233#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:37,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {28234#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:37,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {28234#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:37,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {28235#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 05:57:37,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {28235#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:37,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {28236#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:37,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {28236#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:37,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {28237#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:37,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {28237#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:37,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {28238#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:37,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {28238#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:37,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {28239#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:37,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {28239#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:37,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {28240#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:37,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {28240#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:37,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {28241#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:37,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {28241#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:37,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {28242#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -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 29)} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {28242#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28243#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {28243#(<= main_~i~0 30)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 05:57:37,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 05:57:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:37,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:37,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947498423] [2022-04-15 05:57:37,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947498423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:37,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79571936] [2022-04-15 05:57:37,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:37,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:37,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:37,243 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:37,244 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:37,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:37,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:37,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 05:57:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:37,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:37,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28208#true} is VALID [2022-04-15 05:57:37,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#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(10, 2); {28208#true} is VALID [2022-04-15 05:57:37,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 05:57:37,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 05:57:37,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 05:57:37,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28263#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:37,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {28263#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28263#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:37,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {28263#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:37,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {28214#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 05:57:37,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {28214#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:37,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {28215#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28215#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:37,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {28215#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:37,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {28216#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28216#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:37,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {28216#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:37,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {28217#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28217#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:37,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {28217#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:37,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {28218#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28218#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:37,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {28218#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:37,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {28219#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28219#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:37,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {28219#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:37,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {28220#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28220#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:37,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {28220#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:37,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {28221#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 05:57:37,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {28221#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:37,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {28222#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28222#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:37,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {28222#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:37,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {28223#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28223#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:37,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {28223#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:37,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {28224#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28224#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:37,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {28224#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:37,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {28225#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28225#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:37,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {28225#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:37,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {28226#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28226#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:37,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {28226#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:37,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {28227#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28227#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:37,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {28227#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:37,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {28228#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 05:57:37,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {28228#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:37,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {28229#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28229#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:37,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {28229#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:37,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {28230#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28230#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:37,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {28230#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:37,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {28231#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28231#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:37,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {28231#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:37,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {28232#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28232#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:37,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {28232#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:37,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {28233#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28233#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:37,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {28233#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:37,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {28234#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28234#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:37,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {28234#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:37,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {28235#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 05:57:37,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {28235#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:37,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {28236#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28236#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:37,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {28236#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:37,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {28237#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28237#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:37,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {28237#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:37,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {28238#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28238#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:37,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {28238#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:37,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {28239#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28239#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:37,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {28239#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:37,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {28240#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28240#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:37,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {28240#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:37,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {28241#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28241#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:37,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {28241#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:37,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {28242#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -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 29)} is VALID [2022-04-15 05:57:37,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {28242#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28243#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {28243#(<= main_~i~0 30)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 05:57:37,898 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 05:57:37,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 05:57:37,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 05:57:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:37,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:39,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {28209#false} assume !false; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 78: Hoare triple {28209#false} assume 0 == ~cond; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 77: Hoare triple {28209#false} ~cond := #in~cond; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L272 TraceCheckUtils]: 76: Hoare triple {28209#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {28209#false} assume !(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:39,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {28209#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28209#false} is VALID [2022-04-15 05:57:39,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {28209#false} assume !!(0 != #t~mem4);havoc #t~mem4; {28209#false} is VALID [2022-04-15 05:57:39,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {28209#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {28209#false} is VALID [2022-04-15 05:57:39,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {28209#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {28209#false} is VALID [2022-04-15 05:57:39,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {28525#(< main_~i~0 1023)} assume !(~i~0 < 1023); {28209#false} is VALID [2022-04-15 05:57:39,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {28529#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28525#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:39,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {28529#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28529#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:39,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {28536#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28529#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:39,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {28536#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28536#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:39,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {28543#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28536#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:39,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {28543#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28543#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:39,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {28550#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28543#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:39,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {28550#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28550#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:39,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {28557#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28550#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:39,212 INFO L290 TraceCheckUtils]: 56: Hoare triple {28557#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28557#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:39,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {28564#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28557#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:39,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {28564#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28564#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:39,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {28571#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28564#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:39,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {28571#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28571#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:39,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {28578#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28571#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:39,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {28578#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28578#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:39,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {28585#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28578#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:39,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {28585#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28585#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:39,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {28592#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28585#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:39,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {28592#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28592#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:39,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {28599#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28592#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:39,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {28599#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28599#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:39,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {28606#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28599#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:39,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {28606#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28606#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:39,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {28613#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28606#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:39,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {28613#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28613#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:39,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {28620#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28613#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:39,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {28620#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28620#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:39,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {28627#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28620#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:39,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {28627#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28627#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:39,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {28634#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28627#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:39,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {28634#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28634#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:39,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {28641#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28634#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:39,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {28641#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28641#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:39,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {28648#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28641#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:39,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {28648#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28648#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:39,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {28655#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28648#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:39,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {28655#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28655#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:39,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {28662#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28655#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:39,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {28662#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28662#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:39,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {28669#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28662#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:39,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {28669#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28669#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:39,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {28676#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28669#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:39,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {28676#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28676#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:39,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {28683#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28676#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:39,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {28683#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28683#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:39,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {28690#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28683#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:39,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {28690#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28690#(< main_~i~0 999)} is VALID [2022-04-15 05:57:39,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {28697#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28690#(< main_~i~0 999)} is VALID [2022-04-15 05:57:39,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {28697#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28697#(< main_~i~0 998)} is VALID [2022-04-15 05:57:39,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {28704#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28697#(< main_~i~0 998)} is VALID [2022-04-15 05:57:39,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {28704#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28704#(< main_~i~0 997)} is VALID [2022-04-15 05:57:39,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {28711#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28704#(< main_~i~0 997)} is VALID [2022-04-15 05:57:39,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {28711#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28711#(< main_~i~0 996)} is VALID [2022-04-15 05:57:39,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {28718#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28711#(< main_~i~0 996)} is VALID [2022-04-15 05:57:39,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {28718#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28718#(< main_~i~0 995)} is VALID [2022-04-15 05:57:39,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {28725#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28718#(< main_~i~0 995)} is VALID [2022-04-15 05:57:39,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {28725#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28725#(< main_~i~0 994)} is VALID [2022-04-15 05:57:39,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {28732#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28725#(< main_~i~0 994)} is VALID [2022-04-15 05:57:39,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {28732#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28732#(< main_~i~0 993)} is VALID [2022-04-15 05:57:39,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {28208#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28732#(< main_~i~0 993)} is VALID [2022-04-15 05:57:39,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {28208#true} call #t~ret5 := main(); {28208#true} is VALID [2022-04-15 05:57:39,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28208#true} {28208#true} #58#return; {28208#true} is VALID [2022-04-15 05:57:39,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {28208#true} assume true; {28208#true} is VALID [2022-04-15 05:57:39,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {28208#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(10, 2); {28208#true} is VALID [2022-04-15 05:57:39,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {28208#true} call ULTIMATE.init(); {28208#true} is VALID [2022-04-15 05:57:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:39,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79571936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:39,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 05:57:39,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328657896] [2022-04-15 05:57:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328657896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:39,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 05:57:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89679827] [2022-04-15 05:57:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 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 80 [2022-04-15 05:57:39,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:39,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:39,279 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:57:39,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 05:57:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 05:57:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 05:57:39,281 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,459 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2022-04-15 05:57:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 05:57:42,459 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 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 80 [2022-04-15 05:57:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 241 transitions. [2022-04-15 05:57:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 241 transitions. [2022-04-15 05:57:42,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 241 transitions. [2022-04-15 05:57:42,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:42,638 INFO L225 Difference]: With dead ends: 215 [2022-04-15 05:57:42,638 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 05:57:42,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 130 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:42,639 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 429 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:42,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 51 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 05:57:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 83. [2022-04-15 05:57:42,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:42,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,935 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,935 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,937 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-04-15 05:57:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-04-15 05:57:42,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-15 05:57:42,938 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-15 05:57:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:42,940 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-04-15 05:57:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-04-15 05:57:42,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:42,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:42,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:42,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-04-15 05:57:42,942 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2022-04-15 05:57:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:42,942 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-04-15 05:57:42,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:42,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 84 transitions. [2022-04-15 05:57:43,069 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:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 05:57:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 05:57:43,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:43,070 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:43,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 05:57:43,275 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:43,275 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 672699853, now seen corresponding path program 63 times [2022-04-15 05:57:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:43,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984860958] [2022-04-15 05:57:43,279 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:43,279 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:43,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash 672699853, now seen corresponding path program 64 times [2022-04-15 05:57:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:43,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20063207] [2022-04-15 05:57:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:43,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {29853#(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(10, 2); {29816#true} is VALID [2022-04-15 05:57:43,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 05:57:43,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 05:57:43,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:43,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {29853#(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(10, 2); {29816#true} is VALID [2022-04-15 05:57:43,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 05:57:43,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 05:57:43,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 05:57:43,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29821#(= main_~i~0 0)} is VALID [2022-04-15 05:57:43,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {29821#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29821#(= main_~i~0 0)} is VALID [2022-04-15 05:57:43,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {29821#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:43,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {29822#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:43,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:43,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:43,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {29823#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:43,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {29824#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:43,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {29824#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:43,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {29825#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:43,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:43,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {29826#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:43,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {29826#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:43,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {29827#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:43,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {29827#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:43,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {29828#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:43,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {29828#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:43,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {29829#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:43,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:43,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {29830#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:43,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {29830#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:43,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {29831#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:43,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {29831#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:43,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {29832#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:43,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {29832#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:43,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {29833#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:43,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {29833#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:43,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {29834#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:43,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {29834#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:43,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {29835#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:43,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {29835#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:43,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {29836#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:43,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {29836#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:43,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {29837#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:43,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {29837#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:43,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:43,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:43,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {29839#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:43,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {29839#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:43,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {29840#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:43,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {29840#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:43,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {29841#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:43,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {29841#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:43,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {29842#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:43,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {29842#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:43,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {29843#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:43,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {29843#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:43,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {29844#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:43,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {29844#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:43,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {29845#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:43,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {29845#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:43,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {29846#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:43,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {29846#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:43,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {29847#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:43,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {29847#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:43,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {29848#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:43,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:43,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {29849#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:43,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {29849#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:43,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {29850#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:43,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {29850#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:43,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {29851#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:43,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {29851#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29852#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {29852#(<= main_~i~0 31)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:43,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:43,783 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 05:57:43,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 05:57:43,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 05:57:43,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 05:57:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:43,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:43,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20063207] [2022-04-15 05:57:43,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20063207] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:43,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694063267] [2022-04-15 05:57:43,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:43,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:43,785 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:43,785 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:43,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:43,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:43,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:57:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:43,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:44,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29816#true} is VALID [2022-04-15 05:57:44,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#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(10, 2); {29816#true} is VALID [2022-04-15 05:57:44,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 05:57:44,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 05:57:44,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 05:57:44,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29872#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:44,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {29872#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29872#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:44,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {29872#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:44,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {29822#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29822#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:44,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {29822#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:44,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {29823#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29823#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:44,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {29823#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:44,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {29824#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29824#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:44,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {29824#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:44,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {29825#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29825#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:44,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:44,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {29826#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29826#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:44,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {29826#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:44,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {29827#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29827#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:44,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {29827#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:44,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {29828#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29828#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:44,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {29828#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:44,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {29829#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29829#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:44,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:44,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {29830#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29830#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:44,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {29830#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:44,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {29831#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29831#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:44,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {29831#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:44,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {29832#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29832#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:44,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {29832#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:44,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {29833#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29833#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:44,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {29833#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:44,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {29834#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29834#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:44,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {29834#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:44,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {29835#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29835#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:44,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {29835#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:44,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {29836#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29836#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:44,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {29836#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:44,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {29837#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29837#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:44,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {29837#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:44,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29838#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:44,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:44,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {29839#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29839#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:44,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {29839#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:44,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {29840#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29840#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:44,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {29840#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:44,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {29841#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29841#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:44,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {29841#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:44,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {29842#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29842#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:44,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {29842#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:44,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {29843#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29843#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:44,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {29843#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:44,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {29844#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29844#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:44,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {29844#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:44,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {29845#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29845#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:44,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {29845#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:44,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {29846#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29846#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:44,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {29846#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:44,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {29847#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29847#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:44,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {29847#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:44,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {29848#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29848#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:44,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:44,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {29849#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29849#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:44,432 INFO L290 TraceCheckUtils]: 63: Hoare triple {29849#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:44,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {29850#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29850#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:44,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {29850#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:44,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {29851#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29851#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {29851#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29852#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {29852#(<= main_~i~0 31)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:44,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 05:57:44,435 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 05:57:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:44,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:45,834 INFO L290 TraceCheckUtils]: 81: Hoare triple {29817#false} assume !false; {29817#false} is VALID [2022-04-15 05:57:45,834 INFO L290 TraceCheckUtils]: 80: Hoare triple {29817#false} assume 0 == ~cond; {29817#false} is VALID [2022-04-15 05:57:45,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {29817#false} ~cond := #in~cond; {29817#false} is VALID [2022-04-15 05:57:45,834 INFO L272 TraceCheckUtils]: 78: Hoare triple {29817#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29817#false} is VALID [2022-04-15 05:57:45,834 INFO L290 TraceCheckUtils]: 77: Hoare triple {29817#false} assume !(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:45,834 INFO L290 TraceCheckUtils]: 76: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 75: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 74: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {29817#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 71: Hoare triple {29817#false} assume !!(0 != #t~mem4);havoc #t~mem4; {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {29817#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {29817#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {29817#false} is VALID [2022-04-15 05:57:45,835 INFO L290 TraceCheckUtils]: 68: Hoare triple {30140#(< main_~i~0 1023)} assume !(~i~0 < 1023); {29817#false} is VALID [2022-04-15 05:57:45,836 INFO L290 TraceCheckUtils]: 67: Hoare triple {30144#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30140#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:45,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {30144#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30144#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:45,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {30151#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30144#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:45,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {30151#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30151#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:45,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {30158#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30151#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:45,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {30158#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30158#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:45,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {30165#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30158#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:45,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {30165#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30165#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:45,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {30172#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30165#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:45,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {30172#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30172#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:45,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {30179#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30172#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:45,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {30179#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30179#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:45,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {30186#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30179#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:45,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {30186#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30186#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:45,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {30193#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30186#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:45,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {30193#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30193#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:45,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {30200#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30193#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:45,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {30200#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30200#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:45,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {30207#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30200#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:45,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {30207#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30207#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:45,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {30214#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30207#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:45,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {30214#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30214#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:45,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {30221#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30214#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:45,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {30221#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30221#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:45,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {30228#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30221#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:45,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {30228#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30228#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:45,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {30235#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30228#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:45,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {30235#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30235#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:45,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {30242#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30235#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:45,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {30242#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30242#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:45,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {30249#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30242#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:45,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {30249#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30249#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:45,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {30256#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30249#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:45,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {30256#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30256#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:45,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {30263#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30256#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:45,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {30263#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30263#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:45,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {30270#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:45,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {30270#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30270#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:45,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {30277#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30270#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:45,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {30277#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30277#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:45,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {30284#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30277#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:45,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {30284#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30284#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:45,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {30291#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30284#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:45,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {30291#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30291#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:45,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {30298#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30291#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:45,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {30298#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30298#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:45,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {30305#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30298#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:45,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {30305#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30305#(< main_~i~0 999)} is VALID [2022-04-15 05:57:45,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {30312#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30305#(< main_~i~0 999)} is VALID [2022-04-15 05:57:45,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {30312#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30312#(< main_~i~0 998)} is VALID [2022-04-15 05:57:45,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {30319#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30312#(< main_~i~0 998)} is VALID [2022-04-15 05:57:45,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {30319#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30319#(< main_~i~0 997)} is VALID [2022-04-15 05:57:45,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {30326#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30319#(< main_~i~0 997)} is VALID [2022-04-15 05:57:45,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {30326#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30326#(< main_~i~0 996)} is VALID [2022-04-15 05:57:45,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {30333#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30326#(< main_~i~0 996)} is VALID [2022-04-15 05:57:45,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {30333#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30333#(< main_~i~0 995)} is VALID [2022-04-15 05:57:45,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {30340#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30333#(< main_~i~0 995)} is VALID [2022-04-15 05:57:45,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {30340#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30340#(< main_~i~0 994)} is VALID [2022-04-15 05:57:45,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {30347#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30340#(< main_~i~0 994)} is VALID [2022-04-15 05:57:45,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {30347#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30347#(< main_~i~0 993)} is VALID [2022-04-15 05:57:45,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {30354#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30347#(< main_~i~0 993)} is VALID [2022-04-15 05:57:45,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {30354#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {30354#(< main_~i~0 992)} is VALID [2022-04-15 05:57:45,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {29816#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {30354#(< main_~i~0 992)} is VALID [2022-04-15 05:57:45,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {29816#true} call #t~ret5 := main(); {29816#true} is VALID [2022-04-15 05:57:45,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29816#true} {29816#true} #58#return; {29816#true} is VALID [2022-04-15 05:57:45,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {29816#true} assume true; {29816#true} is VALID [2022-04-15 05:57:45,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {29816#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(10, 2); {29816#true} is VALID [2022-04-15 05:57:45,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {29816#true} call ULTIMATE.init(); {29816#true} is VALID [2022-04-15 05:57:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:45,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694063267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:45,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:45,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 05:57:45,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:45,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984860958] [2022-04-15 05:57:45,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984860958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:45,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:45,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 05:57:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283659608] [2022-04-15 05:57:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 05:57:45,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:45,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call 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,921 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:45,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 05:57:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 05:57:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 05:57:45,923 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call 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:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:49,288 INFO L93 Difference]: Finished difference Result 221 states and 253 transitions. [2022-04-15 05:57:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 05:57:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 05:57:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call 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:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 248 transitions. [2022-04-15 05:57:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call 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:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 248 transitions. [2022-04-15 05:57:49,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 248 transitions. [2022-04-15 05:57:49,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:49,471 INFO L225 Difference]: With dead ends: 221 [2022-04-15 05:57:49,471 INFO L226 Difference]: Without dead ends: 207 [2022-04-15 05:57:49,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:57:49,472 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 409 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:49,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 36 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-15 05:57:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 85. [2022-04-15 05:57:49,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:49,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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:49,788 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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:49,788 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:49,792 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2022-04-15 05:57:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2022-04-15 05:57:49,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:49,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:49,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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 207 states. [2022-04-15 05:57:49,792 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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 207 states. [2022-04-15 05:57:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:49,796 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2022-04-15 05:57:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2022-04-15 05:57:49,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:49,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:49,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:49,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 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:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 05:57:49,798 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2022-04-15 05:57:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:49,798 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 05:57:49,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call 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:49,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 05:57:49,929 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:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 05:57:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 05:57:49,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:49,929 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:49,947 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:50,131 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:50,132 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 457119087, now seen corresponding path program 65 times [2022-04-15 05:57:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259071254] [2022-04-15 05:57:50,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:57:50,136 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:50,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:50,136 INFO L85 PathProgramCache]: Analyzing trace with hash 457119087, now seen corresponding path program 66 times [2022-04-15 05:57:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:50,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853836101] [2022-04-15 05:57:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:50,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {31506#(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(10, 2); {31468#true} is VALID [2022-04-15 05:57:50,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 05:57:50,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 05:57:50,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:50,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {31506#(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(10, 2); {31468#true} is VALID [2022-04-15 05:57:50,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 05:57:50,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 05:57:50,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 05:57:50,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31473#(= main_~i~0 0)} is VALID [2022-04-15 05:57:50,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {31473#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31473#(= main_~i~0 0)} is VALID [2022-04-15 05:57:50,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {31473#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:50,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {31474#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:50,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {31474#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:50,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {31475#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:50,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {31475#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31476#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:50,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {31476#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31476#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:50,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {31476#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31477#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:50,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {31477#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31477#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:50,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {31477#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31478#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:50,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {31478#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31478#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:50,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {31478#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31479#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:50,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {31479#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 05:57:50,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {31479#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31480#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:50,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {31480#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31480#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:50,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {31480#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31481#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:50,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {31481#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31481#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:50,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {31481#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31482#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:50,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {31482#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31482#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:50,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {31482#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31483#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:50,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {31483#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31483#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:50,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {31483#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31484#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:50,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {31484#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31484#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:50,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {31484#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31485#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:50,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {31485#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31485#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:50,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {31485#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31486#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:50,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {31486#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -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 13)} is VALID [2022-04-15 05:57:50,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {31486#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31487#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:50,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {31487#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31487#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:50,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {31487#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31488#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:50,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {31488#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31488#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:50,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {31488#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31489#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:50,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {31489#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31489#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:50,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {31489#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31490#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:50,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {31490#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31490#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:50,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {31490#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31491#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:50,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {31491#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31491#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:50,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {31491#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31492#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:50,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {31492#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31492#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:50,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {31492#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31493#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:50,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {31493#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -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 20)} is VALID [2022-04-15 05:57:50,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {31493#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31494#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:50,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {31494#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31494#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:50,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {31494#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31495#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:50,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {31495#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31495#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:50,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {31495#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31496#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:50,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {31496#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31496#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:50,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {31496#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31497#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:50,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {31497#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31497#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:50,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {31497#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31498#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:50,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {31498#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31498#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:50,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {31498#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31499#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:50,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {31499#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31499#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:50,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {31499#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31500#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:50,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {31500#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -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 27)} is VALID [2022-04-15 05:57:50,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {31500#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31501#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:50,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {31501#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31501#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:50,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {31501#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31502#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:50,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {31502#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31502#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:50,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {31502#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31503#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:50,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {31503#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31503#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:50,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {31503#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31504#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:50,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {31504#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31504#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:50,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {31504#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31505#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {31505#(<= main_~i~0 32)} assume !(~i~0 < 1023); {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {31469#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {31469#false} assume !!(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {31469#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {31469#false} assume !!(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {31469#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {31469#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 79: Hoare triple {31469#false} assume !(0 != #t~mem4);havoc #t~mem4; {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L272 TraceCheckUtils]: 80: Hoare triple {31469#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31469#false} is VALID [2022-04-15 05:57:50,670 INFO L290 TraceCheckUtils]: 81: Hoare triple {31469#false} ~cond := #in~cond; {31469#false} is VALID [2022-04-15 05:57:50,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {31469#false} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 05:57:50,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 05:57:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:50,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853836101] [2022-04-15 05:57:50,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853836101] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:50,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193512659] [2022-04-15 05:57:50,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:50,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:50,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:50,673 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:50,673 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:50,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:50,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:50,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:50,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:51,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31468#true} is VALID [2022-04-15 05:57:51,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#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(10, 2); {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 67: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,092 INFO L290 TraceCheckUtils]: 70: Hoare triple {31468#true} assume !(~i~0 < 1023); {31468#true} is VALID [2022-04-15 05:57:51,101 INFO L290 TraceCheckUtils]: 71: Hoare triple {31468#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31723#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:51,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {31723#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31723#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:51,102 INFO L290 TraceCheckUtils]: 73: Hoare triple {31723#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {31723#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:51,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {31723#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:51,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {31474#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31474#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:51,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {31474#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {31474#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:51,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {31474#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:51,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {31475#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31475#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:51,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {31475#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {31475#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:51,108 INFO L272 TraceCheckUtils]: 80: Hoare triple {31475#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:51,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:51,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {31755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 05:57:51,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 05:57:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 05:57:51,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:51,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {31469#false} assume !false; {31469#false} is VALID [2022-04-15 05:57:51,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {31755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31469#false} is VALID [2022-04-15 05:57:51,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:51,365 INFO L272 TraceCheckUtils]: 80: Hoare triple {31771#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {31751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:51,366 INFO L290 TraceCheckUtils]: 79: Hoare triple {31771#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:51,366 INFO L290 TraceCheckUtils]: 78: Hoare triple {31771#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:51,366 INFO L290 TraceCheckUtils]: 77: Hoare triple {31781#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31771#(<= main_~i~0 1024)} is VALID [2022-04-15 05:57:51,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {31781#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:51,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {31781#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:51,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {31791#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31781#(<= main_~i~0 1023)} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {31791#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {31791#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {31468#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {31791#(<= main_~i~0 1022)} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {31468#true} assume !(~i~0 < 1023); {31468#true} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {31468#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {31468#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {31468#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {31468#true} call #t~ret5 := main(); {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31468#true} {31468#true} #58#return; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {31468#true} assume true; {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {31468#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(10, 2); {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {31468#true} call ULTIMATE.init(); {31468#true} is VALID [2022-04-15 05:57:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 05:57:51,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193512659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:51,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:51,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7, 7] total 42 [2022-04-15 05:57:51,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259071254] [2022-04-15 05:57:51,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259071254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:51,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:51,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 05:57:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216346960] [2022-04-15 05:57:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:51,375 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 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 84 [2022-04-15 05:57:51,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:51,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call 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,425 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:51,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 05:57:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 05:57:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=975, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:57:51,426 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call 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,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:55,092 INFO L93 Difference]: Finished difference Result 227 states and 260 transitions. [2022-04-15 05:57:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 05:57:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 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 84 [2022-04-15 05:57:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call 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,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 255 transitions. [2022-04-15 05:57:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call 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,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 255 transitions. [2022-04-15 05:57:55,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 255 transitions. [2022-04-15 05:57:55,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:55,286 INFO L225 Difference]: With dead ends: 227 [2022-04-15 05:57:55,286 INFO L226 Difference]: Without dead ends: 213 [2022-04-15 05:57:55,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 163 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:55,287 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 554 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:55,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 31 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-15 05:57:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 87. [2022-04-15 05:57:55,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:55,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:55,615 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:55,615 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:55,618 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2022-04-15 05:57:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-04-15 05:57:55,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:55,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:55,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-15 05:57:55,618 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-15 05:57:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:55,621 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2022-04-15 05:57:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-04-15 05:57:55,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:55,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:55,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:55,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:57:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 05:57:55,622 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2022-04-15 05:57:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:55,622 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 05:57:55,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call 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,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 05:57:55,753 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:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 05:57:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 05:57:55,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:55,754 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:55,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 05:57:55,954 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:55,954 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -557566831, now seen corresponding path program 67 times [2022-04-15 05:57:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443776309] [2022-04-15 05:57:55,959 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:55,959 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:55,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash -557566831, now seen corresponding path program 68 times [2022-04-15 05:57:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:55,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782746404] [2022-04-15 05:57:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:56,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {33175#(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(10, 2); {33136#true} is VALID [2022-04-15 05:57:56,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 05:57:56,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 05:57:56,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:56,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {33175#(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(10, 2); {33136#true} is VALID [2022-04-15 05:57:56,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 05:57:56,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 05:57:56,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 05:57:56,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33141#(= main_~i~0 0)} is VALID [2022-04-15 05:57:56,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {33141#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33141#(= main_~i~0 0)} is VALID [2022-04-15 05:57:56,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {33141#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:56,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {33142#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:56,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {33142#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:56,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {33143#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:56,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {33143#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:56,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {33144#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:56,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {33144#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:56,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {33145#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:56,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {33145#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:56,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {33146#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:56,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {33146#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:56,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {33147#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:56,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {33147#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:56,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {33148#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:56,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {33148#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:56,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {33149#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:56,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {33149#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:56,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {33150#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:56,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {33150#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:56,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {33151#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:56,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {33151#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:56,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {33152#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:56,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {33152#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:56,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {33153#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:56,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {33153#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:56,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {33154#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:56,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {33154#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:56,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {33155#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:56,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {33155#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:56,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {33156#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:56,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {33156#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:56,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {33157#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:56,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {33157#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:56,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {33158#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:56,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {33158#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:56,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {33159#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:56,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {33159#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:56,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {33160#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:56,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {33160#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:56,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {33161#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:56,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {33161#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:56,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {33162#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:56,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {33162#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:56,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {33163#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:56,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {33163#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:56,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {33164#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:56,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {33164#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:56,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {33165#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:56,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {33165#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:56,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {33166#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:56,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {33166#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:56,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {33167#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:56,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {33167#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:56,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {33168#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:56,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:56,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {33169#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:56,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {33169#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:56,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {33170#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:56,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {33170#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:56,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {33171#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:56,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {33171#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:56,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {33172#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:56,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {33172#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:56,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {33173#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:56,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {33173#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33174#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {33174#(<= main_~i~0 33)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 05:57:56,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 05:57:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:56,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782746404] [2022-04-15 05:57:56,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782746404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:56,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530177448] [2022-04-15 05:57:56,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:56,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:56,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:56,539 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:56,540 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:56,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:56,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:56,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 05:57:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:56,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:57,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33136#true} is VALID [2022-04-15 05:57:57,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#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(10, 2); {33136#true} is VALID [2022-04-15 05:57:57,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 05:57:57,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 05:57:57,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 05:57:57,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33194#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:57,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {33194#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33194#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:57,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {33194#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:57,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {33142#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33142#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:57,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {33142#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:57,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {33143#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33143#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:57,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {33143#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:57,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {33144#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33144#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:57,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {33144#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:57,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {33145#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33145#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:57,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {33145#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:57,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {33146#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33146#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:57,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {33146#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:57,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {33147#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33147#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:57,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {33147#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:57,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {33148#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33148#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:57,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {33148#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:57,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {33149#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33149#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:57,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {33149#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:57,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {33150#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33150#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:57,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {33150#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:57,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {33151#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33151#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:57,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {33151#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:57,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {33152#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33152#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:57,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {33152#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:57,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {33153#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33153#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:57,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {33153#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:57,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {33154#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33154#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:57,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {33154#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:57,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {33155#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33155#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:57,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {33155#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:57,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {33156#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33156#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:57,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {33156#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:57,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {33157#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33157#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:57,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {33157#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:57,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {33158#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33158#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:57,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {33158#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:57,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {33159#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33159#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:57,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {33159#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:57,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {33160#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33160#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:57,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {33160#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:57,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {33161#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33161#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:57,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {33161#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:57,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {33162#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33162#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:57,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {33162#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:57,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {33163#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33163#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:57,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {33163#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:57,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {33164#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33164#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:57,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {33164#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:57,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {33165#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33165#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:57,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {33165#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:57,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {33166#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33166#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:57,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {33166#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:57,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {33167#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33167#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:57,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {33167#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:57,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {33168#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33168#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:57,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:57,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {33169#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33169#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:57,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {33169#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:57,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {33170#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33170#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:57,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {33170#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:57,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {33171#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33171#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:57,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {33171#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:57,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {33172#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33172#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:57,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {33172#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:57,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {33173#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33173#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:57,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {33173#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33174#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:57,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {33174#(<= main_~i~0 33)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 05:57:57,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 05:57:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:57,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:58,760 INFO L290 TraceCheckUtils]: 85: Hoare triple {33137#false} assume !false; {33137#false} is VALID [2022-04-15 05:57:58,760 INFO L290 TraceCheckUtils]: 84: Hoare triple {33137#false} assume 0 == ~cond; {33137#false} is VALID [2022-04-15 05:57:58,760 INFO L290 TraceCheckUtils]: 83: Hoare triple {33137#false} ~cond := #in~cond; {33137#false} is VALID [2022-04-15 05:57:58,760 INFO L272 TraceCheckUtils]: 82: Hoare triple {33137#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {33137#false} is VALID [2022-04-15 05:57:58,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {33137#false} assume !(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 80: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {33137#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 75: Hoare triple {33137#false} assume !!(0 != #t~mem4);havoc #t~mem4; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 74: Hoare triple {33137#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {33137#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {33137#false} is VALID [2022-04-15 05:57:58,761 INFO L290 TraceCheckUtils]: 72: Hoare triple {33474#(< main_~i~0 1023)} assume !(~i~0 < 1023); {33137#false} is VALID [2022-04-15 05:57:58,762 INFO L290 TraceCheckUtils]: 71: Hoare triple {33478#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33474#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:58,762 INFO L290 TraceCheckUtils]: 70: Hoare triple {33478#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33478#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:58,762 INFO L290 TraceCheckUtils]: 69: Hoare triple {33485#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33478#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:58,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {33485#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33485#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:58,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {33492#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33485#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:58,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {33492#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33492#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:58,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {33499#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33492#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:58,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {33499#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33499#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:58,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {33506#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33499#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:58,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {33506#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33506#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:58,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {33513#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33506#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:58,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {33513#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33513#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:58,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {33520#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33513#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:58,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {33520#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33520#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:58,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {33527#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33520#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:58,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {33527#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33527#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:58,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {33534#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33527#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:58,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {33534#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33534#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:58,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {33541#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33534#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:58,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {33541#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33541#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:58,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {33548#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33541#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:58,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {33548#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33548#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:58,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {33555#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33548#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:58,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {33555#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33555#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:58,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {33562#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33555#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:58,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {33562#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33562#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:58,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {33569#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33562#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:58,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {33569#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33569#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:58,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {33576#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33569#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:58,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {33576#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33576#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:58,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {33583#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33576#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:58,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {33583#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33583#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:58,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {33590#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33583#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:58,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {33590#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33590#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:58,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {33597#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33590#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:58,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {33597#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33597#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:58,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {33604#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33597#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:58,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {33604#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33604#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:58,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {33611#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33604#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:58,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {33611#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33611#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:58,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {33618#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33611#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:58,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {33618#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33618#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:58,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {33625#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33618#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:58,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {33625#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33625#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:58,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {33632#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33625#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:58,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {33632#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33632#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:58,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {33639#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33632#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:58,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {33639#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33639#(< main_~i~0 999)} is VALID [2022-04-15 05:57:58,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {33646#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33639#(< main_~i~0 999)} is VALID [2022-04-15 05:57:58,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {33646#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33646#(< main_~i~0 998)} is VALID [2022-04-15 05:57:58,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {33653#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33646#(< main_~i~0 998)} is VALID [2022-04-15 05:57:58,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {33653#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33653#(< main_~i~0 997)} is VALID [2022-04-15 05:57:58,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {33660#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33653#(< main_~i~0 997)} is VALID [2022-04-15 05:57:58,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {33660#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33660#(< main_~i~0 996)} is VALID [2022-04-15 05:57:58,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {33667#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33660#(< main_~i~0 996)} is VALID [2022-04-15 05:57:58,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {33667#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33667#(< main_~i~0 995)} is VALID [2022-04-15 05:57:58,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {33674#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33667#(< main_~i~0 995)} is VALID [2022-04-15 05:57:58,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {33674#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33674#(< main_~i~0 994)} is VALID [2022-04-15 05:57:58,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {33681#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33674#(< main_~i~0 994)} is VALID [2022-04-15 05:57:58,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {33681#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33681#(< main_~i~0 993)} is VALID [2022-04-15 05:57:58,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {33688#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33681#(< main_~i~0 993)} is VALID [2022-04-15 05:57:58,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {33688#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33688#(< main_~i~0 992)} is VALID [2022-04-15 05:57:58,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {33695#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33688#(< main_~i~0 992)} is VALID [2022-04-15 05:57:58,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {33695#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33695#(< main_~i~0 991)} is VALID [2022-04-15 05:57:58,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {33702#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33695#(< main_~i~0 991)} is VALID [2022-04-15 05:57:58,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {33702#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33702#(< main_~i~0 990)} is VALID [2022-04-15 05:57:58,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {33136#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33702#(< main_~i~0 990)} is VALID [2022-04-15 05:57:58,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {33136#true} call #t~ret5 := main(); {33136#true} is VALID [2022-04-15 05:57:58,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33136#true} {33136#true} #58#return; {33136#true} is VALID [2022-04-15 05:57:58,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {33136#true} assume true; {33136#true} is VALID [2022-04-15 05:57:58,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {33136#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(10, 2); {33136#true} is VALID [2022-04-15 05:57:58,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {33136#true} call ULTIMATE.init(); {33136#true} is VALID [2022-04-15 05:57:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:57:58,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530177448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:58,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 05:57:58,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:58,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443776309] [2022-04-15 05:57:58,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443776309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:58,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 05:57:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774193082] [2022-04-15 05:57:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:58,785 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 05:57:58,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:58,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call 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:58,837 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:58,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 05:57:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:58,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 05:57:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 05:57:58,839 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call 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:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:02,723 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2022-04-15 05:58:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 05:58:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 05:58:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call 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:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 262 transitions. [2022-04-15 05:58:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call 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:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 262 transitions. [2022-04-15 05:58:02,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 262 transitions. [2022-04-15 05:58:02,914 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:58:02,917 INFO L225 Difference]: With dead ends: 233 [2022-04-15 05:58:02,917 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 05:58:02,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 139 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:58:02,918 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 487 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:02,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 41 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 05:58:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 89. [2022-04-15 05:58:03,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:03,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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:58:03,269 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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:58:03,269 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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:58:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:03,272 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-04-15 05:58:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-04-15 05:58:03,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:03,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:03,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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 219 states. [2022-04-15 05:58:03,272 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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 219 states. [2022-04-15 05:58:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:03,275 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-04-15 05:58:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-04-15 05:58:03,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:03,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:03,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:03,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 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:58:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-15 05:58:03,277 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2022-04-15 05:58:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:03,277 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-15 05:58:03,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call 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,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-15 05:58:03,420 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:58:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 05:58:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 05:58:03,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:03,421 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:03,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 05:58:03,621 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:03,621 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash -713157837, now seen corresponding path program 69 times [2022-04-15 05:58:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:03,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045100752] [2022-04-15 05:58:03,625 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:03,625 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:03,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:03,625 INFO L85 PathProgramCache]: Analyzing trace with hash -713157837, now seen corresponding path program 70 times [2022-04-15 05:58:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:03,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161613695] [2022-04-15 05:58:03,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:03,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:04,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {34916#(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(10, 2); {34876#true} is VALID [2022-04-15 05:58:04,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 05:58:04,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 05:58:04,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:04,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {34916#(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(10, 2); {34876#true} is VALID [2022-04-15 05:58:04,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 05:58:04,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 05:58:04,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 05:58:04,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34881#(= main_~i~0 0)} is VALID [2022-04-15 05:58:04,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {34881#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34881#(= main_~i~0 0)} is VALID [2022-04-15 05:58:04,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {34881#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:04,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {34882#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:04,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {34882#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:04,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {34883#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:04,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {34883#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:04,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {34884#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:04,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {34884#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:04,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {34885#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:04,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {34885#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:04,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {34886#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:04,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {34886#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:04,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {34887#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:04,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {34887#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:04,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {34888#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:04,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {34888#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:04,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {34889#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:04,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {34889#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:04,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {34890#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:04,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {34890#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:04,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {34891#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:04,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {34891#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:04,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {34892#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:04,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {34892#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:04,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {34893#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:04,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {34893#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:04,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {34894#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:04,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {34894#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:04,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {34895#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:04,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {34895#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:04,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {34896#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:04,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {34896#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:04,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {34897#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:04,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {34897#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:04,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {34898#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:04,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {34898#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:04,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {34899#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:04,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {34899#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:04,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {34900#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:04,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {34900#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:04,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {34901#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:04,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {34901#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:04,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {34902#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:04,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {34902#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:04,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {34903#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:04,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {34903#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:04,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {34904#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:04,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {34904#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:04,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {34905#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:04,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {34905#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:04,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {34906#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:04,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {34906#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:04,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {34907#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:04,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {34907#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:04,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {34908#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:04,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {34908#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:04,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {34909#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:04,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {34909#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:04,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {34910#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:04,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {34910#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:04,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:04,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {34911#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:04,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {34912#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:04,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {34912#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:04,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {34913#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:04,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {34913#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:04,255 INFO L290 TraceCheckUtils]: 72: Hoare triple {34914#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:04,255 INFO L290 TraceCheckUtils]: 73: Hoare triple {34914#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34915#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {34915#(<= main_~i~0 34)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:04,256 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:04,257 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 05:58:04,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 05:58:04,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 05:58:04,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 05:58:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:04,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:04,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161613695] [2022-04-15 05:58:04,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161613695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933995103] [2022-04-15 05:58:04,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:04,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:04,260 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:04,285 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:04,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:04,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:04,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 05:58:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:04,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:04,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34876#true} is VALID [2022-04-15 05:58:04,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#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(10, 2); {34876#true} is VALID [2022-04-15 05:58:04,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 05:58:04,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 05:58:04,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 05:58:04,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34935#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:04,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {34935#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34935#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:04,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {34935#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:04,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {34882#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34882#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:04,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {34882#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:04,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {34883#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34883#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:04,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {34883#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:04,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {34884#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34884#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:04,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {34884#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:04,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {34885#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34885#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:04,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {34885#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:04,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {34886#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34886#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:04,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {34886#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:05,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {34887#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34887#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:05,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {34887#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:05,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {34888#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34888#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:05,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {34888#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:05,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {34889#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34889#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:05,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {34889#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:05,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {34890#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34890#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:05,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {34890#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:05,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {34891#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34891#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:05,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {34891#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:05,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {34892#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34892#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:05,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {34892#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:05,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {34893#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34893#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:05,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {34893#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:05,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {34894#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34894#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:05,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {34894#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:05,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {34895#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34895#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:05,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {34895#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:05,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {34896#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34896#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:05,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {34896#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:05,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {34897#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34897#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:05,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {34897#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:05,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {34898#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34898#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:05,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {34898#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:05,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {34899#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34899#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:05,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {34899#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:05,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {34900#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34900#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:05,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {34900#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:05,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {34901#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34901#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:05,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {34901#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:05,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {34902#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34902#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:05,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {34902#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:05,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {34903#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34903#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:05,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {34903#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:05,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {34904#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34904#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:05,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {34904#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:05,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {34905#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34905#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:05,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {34905#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:05,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {34906#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34906#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:05,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {34906#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:05,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {34907#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34907#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:05,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {34907#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:05,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {34908#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34908#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:05,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {34908#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:05,019 INFO L290 TraceCheckUtils]: 62: Hoare triple {34909#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34909#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:05,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {34909#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:05,019 INFO L290 TraceCheckUtils]: 64: Hoare triple {34910#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34910#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:05,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {34910#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:05,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34911#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:05,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {34911#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:05,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {34912#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34912#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:05,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {34912#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:05,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {34913#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34913#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:05,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {34913#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:05,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {34914#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34914#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:05,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {34914#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34915#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 74: Hoare triple {34915#(<= main_~i~0 34)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:05,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:05,025 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 05:58:05,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 05:58:05,025 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 05:58:05,025 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 05:58:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:05,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:06,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {34877#false} assume !false; {34877#false} is VALID [2022-04-15 05:58:06,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {34877#false} assume 0 == ~cond; {34877#false} is VALID [2022-04-15 05:58:06,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {34877#false} ~cond := #in~cond; {34877#false} is VALID [2022-04-15 05:58:06,676 INFO L272 TraceCheckUtils]: 84: Hoare triple {34877#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {34877#false} is VALID [2022-04-15 05:58:06,676 INFO L290 TraceCheckUtils]: 83: Hoare triple {34877#false} assume !(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 82: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 81: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 79: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {34877#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 77: Hoare triple {34877#false} assume !!(0 != #t~mem4);havoc #t~mem4; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 76: Hoare triple {34877#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {34877#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {34877#false} is VALID [2022-04-15 05:58:06,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {35221#(< main_~i~0 1023)} assume !(~i~0 < 1023); {34877#false} is VALID [2022-04-15 05:58:06,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {35225#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35221#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:06,678 INFO L290 TraceCheckUtils]: 72: Hoare triple {35225#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35225#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:06,678 INFO L290 TraceCheckUtils]: 71: Hoare triple {35232#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35225#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:06,679 INFO L290 TraceCheckUtils]: 70: Hoare triple {35232#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35232#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:06,679 INFO L290 TraceCheckUtils]: 69: Hoare triple {35239#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35232#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:06,679 INFO L290 TraceCheckUtils]: 68: Hoare triple {35239#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35239#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:06,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {35246#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35239#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:06,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {35246#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35246#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:06,680 INFO L290 TraceCheckUtils]: 65: Hoare triple {35253#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35246#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:06,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {35253#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35253#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:06,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {35260#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35253#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:06,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {35260#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35260#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:06,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {35267#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35260#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:06,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {35267#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35267#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:06,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {35274#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35267#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:06,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {35274#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35274#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:06,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {35281#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35274#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:06,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {35281#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35281#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:06,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {35288#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35281#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:06,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {35288#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35288#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:06,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {35295#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35288#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:06,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {35295#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35295#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:06,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {35302#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35295#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:06,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {35302#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35302#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:06,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {35309#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35302#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:06,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {35309#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35309#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:06,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {35316#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35309#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:06,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {35316#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35316#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:06,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {35323#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35316#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:06,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {35323#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35323#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:06,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {35330#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35323#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:06,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {35330#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35330#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:06,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {35337#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35330#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:06,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {35337#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35337#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:06,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {35344#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35337#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:06,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {35344#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35344#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:06,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {35351#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35344#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:06,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {35351#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35351#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:06,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {35358#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35351#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:06,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {35358#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35358#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:06,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {35365#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35358#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:06,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {35365#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35365#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:06,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {35372#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35365#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:06,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {35372#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35372#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:06,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {35379#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35372#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:06,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {35379#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35379#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:06,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {35386#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35379#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:06,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {35386#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35386#(< main_~i~0 999)} is VALID [2022-04-15 05:58:06,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {35393#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35386#(< main_~i~0 999)} is VALID [2022-04-15 05:58:06,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {35393#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35393#(< main_~i~0 998)} is VALID [2022-04-15 05:58:06,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {35400#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35393#(< main_~i~0 998)} is VALID [2022-04-15 05:58:06,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {35400#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35400#(< main_~i~0 997)} is VALID [2022-04-15 05:58:06,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {35407#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35400#(< main_~i~0 997)} is VALID [2022-04-15 05:58:06,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {35407#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35407#(< main_~i~0 996)} is VALID [2022-04-15 05:58:06,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {35414#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35407#(< main_~i~0 996)} is VALID [2022-04-15 05:58:06,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {35414#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35414#(< main_~i~0 995)} is VALID [2022-04-15 05:58:06,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {35421#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35414#(< main_~i~0 995)} is VALID [2022-04-15 05:58:06,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {35421#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35421#(< main_~i~0 994)} is VALID [2022-04-15 05:58:06,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {35428#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35421#(< main_~i~0 994)} is VALID [2022-04-15 05:58:06,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {35428#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35428#(< main_~i~0 993)} is VALID [2022-04-15 05:58:06,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {35435#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35428#(< main_~i~0 993)} is VALID [2022-04-15 05:58:06,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {35435#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35435#(< main_~i~0 992)} is VALID [2022-04-15 05:58:06,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {35442#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35435#(< main_~i~0 992)} is VALID [2022-04-15 05:58:06,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {35442#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35442#(< main_~i~0 991)} is VALID [2022-04-15 05:58:06,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {35449#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35442#(< main_~i~0 991)} is VALID [2022-04-15 05:58:06,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {35449#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35449#(< main_~i~0 990)} is VALID [2022-04-15 05:58:06,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {35456#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35449#(< main_~i~0 990)} is VALID [2022-04-15 05:58:06,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {35456#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {35456#(< main_~i~0 989)} is VALID [2022-04-15 05:58:06,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {34876#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {35456#(< main_~i~0 989)} is VALID [2022-04-15 05:58:06,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {34876#true} call #t~ret5 := main(); {34876#true} is VALID [2022-04-15 05:58:06,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34876#true} {34876#true} #58#return; {34876#true} is VALID [2022-04-15 05:58:06,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {34876#true} assume true; {34876#true} is VALID [2022-04-15 05:58:06,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {34876#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(10, 2); {34876#true} is VALID [2022-04-15 05:58:06,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {34876#true} call ULTIMATE.init(); {34876#true} is VALID [2022-04-15 05:58:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:06,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933995103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:06,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:06,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 05:58:06,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:06,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045100752] [2022-04-15 05:58:06,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045100752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:06,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:06,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 05:58:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608366666] [2022-04-15 05:58:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 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 88 [2022-04-15 05:58:06,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:06,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call 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:06,757 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:58:06,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 05:58:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:06,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 05:58:06,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 05:58:06,759 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call 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:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:10,924 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2022-04-15 05:58:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 05:58:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 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 88 [2022-04-15 05:58:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call 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:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 269 transitions. [2022-04-15 05:58:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call 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:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 269 transitions. [2022-04-15 05:58:10,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 269 transitions. [2022-04-15 05:58:11,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:11,135 INFO L225 Difference]: With dead ends: 239 [2022-04-15 05:58:11,135 INFO L226 Difference]: Without dead ends: 225 [2022-04-15 05:58:11,136 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 05:58:11,136 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 500 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:11,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 31 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-15 05:58:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 91. [2022-04-15 05:58:11,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:11,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:11,509 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:11,510 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:11,513 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2022-04-15 05:58:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2022-04-15 05:58:11,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:11,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:11,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-15 05:58:11,514 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 225 states. [2022-04-15 05:58:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:11,518 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2022-04-15 05:58:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 259 transitions. [2022-04-15 05:58:11,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:11,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:11,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:11,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 05:58:11,520 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2022-04-15 05:58:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:11,520 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 05:58:11,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call 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,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 05:58:11,665 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:58:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 05:58:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 05:58:11,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:11,665 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:11,694 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:11,889 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:11,889 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 87740757, now seen corresponding path program 71 times [2022-04-15 05:58:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603365819] [2022-04-15 05:58:11,894 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:11,894 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:11,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash 87740757, now seen corresponding path program 72 times [2022-04-15 05:58:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:11,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834052380] [2022-04-15 05:58:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:12,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {36701#(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(10, 2); {36660#true} is VALID [2022-04-15 05:58:12,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 05:58:12,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 05:58:12,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:12,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {36701#(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(10, 2); {36660#true} is VALID [2022-04-15 05:58:12,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 05:58:12,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 05:58:12,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 05:58:12,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36665#(= main_~i~0 0)} is VALID [2022-04-15 05:58:12,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {36665#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36665#(= main_~i~0 0)} is VALID [2022-04-15 05:58:12,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {36665#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:12,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {36666#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:12,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {36666#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:12,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {36667#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:12,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {36667#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36668#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:12,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {36668#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36668#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:12,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {36668#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36669#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:12,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {36669#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36669#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:12,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {36669#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36670#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:12,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {36670#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36670#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:12,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {36670#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36671#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:12,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {36671#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36671#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:12,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {36671#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36672#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:12,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {36672#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36672#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:12,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {36672#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36673#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:12,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {36673#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36673#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:12,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {36673#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36674#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:12,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {36674#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36674#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:12,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {36674#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36675#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:12,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {36675#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36675#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:12,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {36675#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36676#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:12,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {36676#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36676#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:12,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {36676#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36677#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:12,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {36677#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36677#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:12,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {36677#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36678#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:12,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {36678#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36678#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:12,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {36678#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36679#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:12,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {36679#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36679#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:12,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {36679#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36680#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:12,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {36680#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36680#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:12,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {36680#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36681#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:12,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {36681#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36681#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:12,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {36681#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36682#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:12,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {36682#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36682#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:12,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {36682#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36683#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:12,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {36683#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36683#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:12,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {36683#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36684#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:12,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {36684#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36684#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:12,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {36684#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36685#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:12,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {36685#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36685#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:12,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {36685#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36686#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:12,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {36686#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36686#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:12,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {36686#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36687#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:12,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {36687#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36687#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:12,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {36687#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36688#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:12,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {36688#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36688#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:12,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {36688#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36689#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:12,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {36689#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36689#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:12,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {36689#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36690#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:12,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {36690#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36690#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:12,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {36690#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36691#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:12,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {36691#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36691#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:12,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {36691#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36692#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:12,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {36692#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36692#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:12,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {36692#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36693#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:12,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {36693#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36693#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:12,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {36693#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36694#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:12,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {36694#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36694#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:12,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {36694#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36695#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:12,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {36695#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36695#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:12,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {36695#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36696#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:12,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {36696#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36696#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:12,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {36696#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36697#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:12,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {36697#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36697#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:12,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {36697#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36698#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:12,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {36698#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36698#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:12,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {36698#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36699#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:12,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {36699#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36699#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:12,513 INFO L290 TraceCheckUtils]: 75: Hoare triple {36699#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36700#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:12,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {36700#(<= main_~i~0 35)} assume !(~i~0 < 1023); {36661#false} is VALID [2022-04-15 05:58:12,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {36661#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {36661#false} is VALID [2022-04-15 05:58:12,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {36661#false} assume !!(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 80: Hoare triple {36661#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 81: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 82: Hoare triple {36661#false} assume !!(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {36661#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {36661#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {36661#false} assume !(0 != #t~mem4);havoc #t~mem4; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L272 TraceCheckUtils]: 86: Hoare triple {36661#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 87: Hoare triple {36661#false} ~cond := #in~cond; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {36661#false} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 05:58:12,514 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 05:58:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834052380] [2022-04-15 05:58:12,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834052380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123674019] [2022-04-15 05:58:12,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:12,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:12,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:12,516 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:12,517 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:12,693 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:58:12,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:12,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:58:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:12,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:12,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#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(10, 2); {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 51: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 62: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 74: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 75: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:12,933 INFO L290 TraceCheckUtils]: 76: Hoare triple {36660#true} assume !(~i~0 < 1023); {36660#true} is VALID [2022-04-15 05:58:12,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {36660#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {36936#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:12,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {36936#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36936#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:12,934 INFO L290 TraceCheckUtils]: 79: Hoare triple {36936#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {36936#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:12,934 INFO L290 TraceCheckUtils]: 80: Hoare triple {36936#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:12,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {36666#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36666#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:12,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {36666#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {36666#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:12,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {36666#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:12,936 INFO L290 TraceCheckUtils]: 84: Hoare triple {36667#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36667#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:12,936 INFO L290 TraceCheckUtils]: 85: Hoare triple {36667#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {36667#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:12,936 INFO L272 TraceCheckUtils]: 86: Hoare triple {36667#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:12,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:12,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {36968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 05:58:12,937 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 05:58:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 05:58:12,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:13,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {36661#false} assume !false; {36661#false} is VALID [2022-04-15 05:58:13,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {36968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36661#false} is VALID [2022-04-15 05:58:13,191 INFO L290 TraceCheckUtils]: 87: Hoare triple {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:13,191 INFO L272 TraceCheckUtils]: 86: Hoare triple {36984#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {36964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:13,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {36984#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:13,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {36984#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:13,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {36994#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36984#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:13,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {36994#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:13,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {36994#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:13,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {37004#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36994#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:13,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {37004#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {37004#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {36660#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {37004#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 76: Hoare triple {36660#true} assume !(~i~0 < 1023); {36660#true} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 75: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 72: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 71: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 70: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 58: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {36660#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {36660#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {36660#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {36660#true} call #t~ret5 := main(); {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36660#true} {36660#true} #58#return; {36660#true} is VALID [2022-04-15 05:58:13,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {36660#true} assume true; {36660#true} is VALID [2022-04-15 05:58:13,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {36660#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(10, 2); {36660#true} is VALID [2022-04-15 05:58:13,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {36660#true} call ULTIMATE.init(); {36660#true} is VALID [2022-04-15 05:58:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 05:58:13,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123674019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:13,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:13,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 7, 7] total 45 [2022-04-15 05:58:13,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:13,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603365819] [2022-04-15 05:58:13,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603365819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:13,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 05:58:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549488545] [2022-04-15 05:58:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:58:13,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:13,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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:13,255 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:58:13,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 05:58:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:13,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 05:58:13,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=1113, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 05:58:13,256 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:17,544 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2022-04-15 05:58:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 05:58:17,544 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 05:58:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 276 transitions. [2022-04-15 05:58:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 276 transitions. [2022-04-15 05:58:17,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 276 transitions. [2022-04-15 05:58:17,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:17,750 INFO L225 Difference]: With dead ends: 245 [2022-04-15 05:58:17,750 INFO L226 Difference]: Without dead ends: 231 [2022-04-15 05:58:17,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2380, Invalid=4100, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 05:58:17,751 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 569 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:17,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 31 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-15 05:58:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 93. [2022-04-15 05:58:18,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:18,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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:58:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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:58:18,134 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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:58:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:18,137 INFO L93 Difference]: Finished difference Result 231 states and 266 transitions. [2022-04-15 05:58:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2022-04-15 05:58:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:18,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:18,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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 231 states. [2022-04-15 05:58:18,137 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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 231 states. [2022-04-15 05:58:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:18,140 INFO L93 Difference]: Finished difference Result 231 states and 266 transitions. [2022-04-15 05:58:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2022-04-15 05:58:18,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:18,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:18,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:18,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 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:58:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-15 05:58:18,141 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2022-04-15 05:58:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:18,142 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-15 05:58:18,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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:18,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 94 transitions. [2022-04-15 05:58:18,286 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:58:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 05:58:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 05:58:18,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:18,287 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:18,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 05:58:18,491 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:18,491 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 952143607, now seen corresponding path program 73 times [2022-04-15 05:58:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:18,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296435142] [2022-04-15 05:58:18,495 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:18,495 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:18,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 952143607, now seen corresponding path program 74 times [2022-04-15 05:58:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:18,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482373388] [2022-04-15 05:58:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:19,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {38499#(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(10, 2); {38457#true} is VALID [2022-04-15 05:58:19,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 05:58:19,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 05:58:19,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:19,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {38499#(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(10, 2); {38457#true} is VALID [2022-04-15 05:58:19,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 05:58:19,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 05:58:19,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 05:58:19,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38462#(= main_~i~0 0)} is VALID [2022-04-15 05:58:19,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {38462#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 05:58:19,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {38462#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:19,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {38463#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 05:58:19,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {38463#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:19,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {38464#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 05:58:19,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {38464#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:19,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {38465#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 05:58:19,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {38465#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:19,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {38466#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 05:58:19,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {38466#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:19,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {38467#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 05:58:19,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {38467#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:19,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {38468#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:19,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {38468#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:19,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {38469#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:19,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {38469#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:19,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {38470#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:19,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {38470#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:19,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {38471#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:19,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {38471#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:19,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {38472#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:19,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {38472#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:19,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:19,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {38473#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:19,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {38474#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:19,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {38474#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:19,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {38475#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:19,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {38475#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:19,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {38476#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:19,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {38476#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:19,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {38477#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:19,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {38477#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:19,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {38478#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:19,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {38478#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:19,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {38479#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:19,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {38479#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:19,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {38480#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:19,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {38480#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:19,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {38481#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:19,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {38481#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:19,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {38482#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:19,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {38482#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:19,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {38483#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:19,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {38483#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:19,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {38484#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:19,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {38484#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:19,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {38485#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:19,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {38485#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:19,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {38486#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:19,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {38486#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:19,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {38487#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:19,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {38487#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38488#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:19,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {38488#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -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 26)} is VALID [2022-04-15 05:58:19,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {38488#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:19,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {38489#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:19,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {38489#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:19,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {38490#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:19,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {38490#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:19,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {38491#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:19,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {38491#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:19,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {38492#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:19,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {38492#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:19,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {38493#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:19,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {38493#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:19,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {38494#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:19,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {38494#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:19,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {38495#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:19,153 INFO L290 TraceCheckUtils]: 73: Hoare triple {38495#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:19,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {38496#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:19,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {38496#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:19,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {38497#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {38497#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38498#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {38498#(<= main_~i~0 36)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 05:58:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482373388] [2022-04-15 05:58:19,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482373388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454945611] [2022-04-15 05:58:19,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:58:19,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:19,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:19,157 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:19,157 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:19,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:58:19,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:19,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 05:58:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:19,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:19,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38457#true} is VALID [2022-04-15 05:58:19,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#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(10, 2); {38457#true} is VALID [2022-04-15 05:58:19,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 05:58:19,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 05:58:19,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 05:58:19,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38518#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:19,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {38518#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38518#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:19,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {38518#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:19,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {38463#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 05:58:19,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {38463#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:19,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {38464#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 05:58:19,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {38464#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:19,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {38465#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 05:58:19,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {38465#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:19,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {38466#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 05:58:19,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {38466#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:19,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {38467#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 05:58:19,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {38467#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:19,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {38468#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38468#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:19,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {38468#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:19,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {38469#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38469#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:19,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {38469#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:19,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {38470#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38470#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:19,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {38470#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:19,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {38471#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38471#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:19,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {38471#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:19,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {38472#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38472#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:19,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {38472#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:19,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38473#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:19,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {38473#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:19,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {38474#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38474#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:19,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {38474#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:19,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {38475#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38475#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:19,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {38475#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:19,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {38476#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38476#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:19,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {38476#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:19,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {38477#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38477#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:19,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {38477#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:19,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {38478#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38478#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:19,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {38478#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:19,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {38479#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38479#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:19,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {38479#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:19,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {38480#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38480#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:19,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {38480#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:19,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {38481#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38481#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:19,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {38481#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:19,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {38482#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38482#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:19,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {38482#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:19,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {38483#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38483#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:19,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {38483#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:19,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {38484#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38484#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:19,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {38484#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:19,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {38485#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38485#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:19,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {38485#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:19,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {38486#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38486#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:19,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {38486#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:19,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {38487#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38487#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:19,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {38487#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38488#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:19,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {38488#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -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 26)} is VALID [2022-04-15 05:58:19,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {38488#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:19,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {38489#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38489#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:19,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {38489#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:19,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {38490#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38490#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:19,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {38490#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:19,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {38491#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38491#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:19,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {38491#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:19,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {38492#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38492#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:19,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {38492#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:19,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {38493#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38493#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:19,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {38493#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:19,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {38494#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38494#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:19,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {38494#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:19,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {38495#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38495#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:19,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {38495#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:19,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {38496#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38496#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:19,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {38496#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:19,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {38497#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38497#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:19,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {38497#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38498#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {38498#(<= main_~i~0 36)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 05:58:19,874 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 05:58:19,875 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 05:58:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:19,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:21,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {38458#false} assume !false; {38458#false} is VALID [2022-04-15 05:58:21,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {38458#false} assume 0 == ~cond; {38458#false} is VALID [2022-04-15 05:58:21,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {38458#false} ~cond := #in~cond; {38458#false} is VALID [2022-04-15 05:58:21,670 INFO L272 TraceCheckUtils]: 88: Hoare triple {38458#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {38458#false} is VALID [2022-04-15 05:58:21,670 INFO L290 TraceCheckUtils]: 87: Hoare triple {38458#false} assume !(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 86: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 85: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 84: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {38458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {38458#false} assume !!(0 != #t~mem4);havoc #t~mem4; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {38458#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {38458#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {38458#false} is VALID [2022-04-15 05:58:21,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {38816#(< main_~i~0 1023)} assume !(~i~0 < 1023); {38458#false} is VALID [2022-04-15 05:58:21,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {38820#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38816#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:21,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {38820#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38820#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:21,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {38827#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38820#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:21,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {38827#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38827#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:21,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {38834#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38827#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:21,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {38834#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38834#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:21,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {38841#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38834#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:21,674 INFO L290 TraceCheckUtils]: 70: Hoare triple {38841#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38841#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:21,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {38848#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38841#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:21,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {38848#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38848#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:21,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {38855#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38848#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:21,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {38855#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38855#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:21,676 INFO L290 TraceCheckUtils]: 65: Hoare triple {38862#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38855#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:21,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {38862#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38862#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:21,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {38869#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38862#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:21,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {38869#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38869#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:21,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {38876#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38869#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:21,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {38876#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38876#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:21,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {38883#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38876#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:21,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {38883#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38883#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:21,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {38890#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38883#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:21,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {38890#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38890#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:21,679 INFO L290 TraceCheckUtils]: 55: Hoare triple {38897#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38890#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:21,679 INFO L290 TraceCheckUtils]: 54: Hoare triple {38897#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38897#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:21,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {38904#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38897#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:21,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {38904#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38904#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:21,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {38911#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38904#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:21,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {38911#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38911#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:21,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {38918#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38911#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:21,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {38918#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38918#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:21,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {38925#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38918#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:21,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {38925#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38925#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:21,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {38932#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38925#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:21,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {38932#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38932#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:21,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {38939#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38932#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:21,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {38939#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38939#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:21,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {38946#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38939#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:21,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {38946#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38946#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:21,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {38953#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38946#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:21,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {38953#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38953#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:21,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {38960#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38953#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:21,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {38960#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38960#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:21,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {38967#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38960#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:21,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {38967#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38967#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:21,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {38974#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38967#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:21,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {38974#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38974#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:21,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {38981#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38974#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:21,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {38981#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38981#(< main_~i~0 999)} is VALID [2022-04-15 05:58:21,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {38988#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38981#(< main_~i~0 999)} is VALID [2022-04-15 05:58:21,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {38988#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38988#(< main_~i~0 998)} is VALID [2022-04-15 05:58:21,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {38995#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38988#(< main_~i~0 998)} is VALID [2022-04-15 05:58:21,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {38995#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38995#(< main_~i~0 997)} is VALID [2022-04-15 05:58:21,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {39002#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38995#(< main_~i~0 997)} is VALID [2022-04-15 05:58:21,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {39002#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39002#(< main_~i~0 996)} is VALID [2022-04-15 05:58:21,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {39009#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39002#(< main_~i~0 996)} is VALID [2022-04-15 05:58:21,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {39009#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39009#(< main_~i~0 995)} is VALID [2022-04-15 05:58:21,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {39016#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39009#(< main_~i~0 995)} is VALID [2022-04-15 05:58:21,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {39016#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39016#(< main_~i~0 994)} is VALID [2022-04-15 05:58:21,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {39023#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39016#(< main_~i~0 994)} is VALID [2022-04-15 05:58:21,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {39023#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39023#(< main_~i~0 993)} is VALID [2022-04-15 05:58:21,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {39030#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39023#(< main_~i~0 993)} is VALID [2022-04-15 05:58:21,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {39030#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39030#(< main_~i~0 992)} is VALID [2022-04-15 05:58:21,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {39037#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39030#(< main_~i~0 992)} is VALID [2022-04-15 05:58:21,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {39037#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39037#(< main_~i~0 991)} is VALID [2022-04-15 05:58:21,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {39044#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39037#(< main_~i~0 991)} is VALID [2022-04-15 05:58:21,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {39044#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39044#(< main_~i~0 990)} is VALID [2022-04-15 05:58:21,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {39051#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39044#(< main_~i~0 990)} is VALID [2022-04-15 05:58:21,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {39051#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39051#(< main_~i~0 989)} is VALID [2022-04-15 05:58:21,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {39058#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39051#(< main_~i~0 989)} is VALID [2022-04-15 05:58:21,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {39058#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39058#(< main_~i~0 988)} is VALID [2022-04-15 05:58:21,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {39065#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39058#(< main_~i~0 988)} is VALID [2022-04-15 05:58:21,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {39065#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39065#(< main_~i~0 987)} is VALID [2022-04-15 05:58:21,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {38457#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {39065#(< main_~i~0 987)} is VALID [2022-04-15 05:58:21,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {38457#true} call #t~ret5 := main(); {38457#true} is VALID [2022-04-15 05:58:21,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38457#true} {38457#true} #58#return; {38457#true} is VALID [2022-04-15 05:58:21,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {38457#true} assume true; {38457#true} is VALID [2022-04-15 05:58:21,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {38457#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(10, 2); {38457#true} is VALID [2022-04-15 05:58:21,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {38457#true} call ULTIMATE.init(); {38457#true} is VALID [2022-04-15 05:58:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:21,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454945611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:21,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:21,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 05:58:21,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:21,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296435142] [2022-04-15 05:58:21,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296435142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:21,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 05:58:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346802458] [2022-04-15 05:58:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 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 92 [2022-04-15 05:58:21,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:21,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call 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:21,752 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:58:21,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 05:58:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 05:58:21,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 05:58:21,754 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call 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,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,217 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2022-04-15 05:58:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 05:58:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 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 92 [2022-04-15 05:58:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call 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,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 283 transitions. [2022-04-15 05:58:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call 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,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 283 transitions. [2022-04-15 05:58:26,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 283 transitions. [2022-04-15 05:58:26,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:26,424 INFO L225 Difference]: With dead ends: 251 [2022-04-15 05:58:26,424 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 05:58:26,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 05:58:26,425 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 481 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:26,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 46 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 05:58:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 95. [2022-04-15 05:58:26,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:26,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:26,828 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:26,828 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,830 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2022-04-15 05:58:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2022-04-15 05:58:26,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:26,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:26,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-15 05:58:26,831 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 237 states. [2022-04-15 05:58:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,833 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2022-04-15 05:58:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2022-04-15 05:58:26,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:26,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:26,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:26,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-04-15 05:58:26,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2022-04-15 05:58:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:26,840 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-04-15 05:58:26,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 2 states have call successors, (3), 3 states have call 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,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 96 transitions. [2022-04-15 05:58:26,988 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:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 05:58:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 05:58:26,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:26,989 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:27,005 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,189 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,189 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1580372967, now seen corresponding path program 75 times [2022-04-15 05:58:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:27,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104628697] [2022-04-15 05:58:27,194 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,194 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:27,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1580372967, now seen corresponding path program 76 times [2022-04-15 05:58:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679584846] [2022-04-15 05:58:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:27,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {40372#(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(10, 2); {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:27,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {40372#(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(10, 2); {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 05:58:27,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 05:58:27,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40334#(= main_~i~0 0)} is VALID [2022-04-15 05:58:27,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {40334#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40334#(= main_~i~0 0)} is VALID [2022-04-15 05:58:27,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {40334#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:27,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {40335#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:27,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {40335#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:27,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {40336#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:27,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {40336#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:27,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {40337#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:27,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {40337#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:27,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {40338#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:27,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {40338#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:27,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {40339#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:27,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {40339#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:27,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {40340#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:27,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {40340#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:27,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {40341#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:27,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {40341#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:27,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {40342#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:27,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {40342#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:27,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {40343#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:27,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {40343#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:27,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {40344#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:27,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {40344#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:27,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {40345#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:27,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {40345#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:27,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {40346#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:27,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {40346#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:27,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {40347#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:27,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {40347#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:27,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {40348#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:27,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {40348#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:27,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {40349#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:27,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {40349#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:27,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {40350#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:27,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {40350#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:27,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {40351#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:27,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {40351#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:27,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {40352#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:27,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {40352#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:27,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {40353#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:27,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {40353#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:27,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {40354#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:27,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {40354#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:27,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {40355#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:27,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {40355#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:27,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {40356#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:27,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {40356#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:27,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {40357#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:27,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {40357#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:27,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {40358#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:27,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {40358#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:27,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {40359#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:27,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {40359#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:27,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {40360#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:27,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {40360#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:27,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {40361#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:27,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {40361#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:27,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {40362#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:27,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {40362#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:27,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {40363#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:27,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {40363#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:27,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {40364#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:27,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {40364#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:27,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {40365#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:27,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {40365#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:27,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {40366#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:27,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {40366#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:27,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {40367#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:27,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {40367#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:27,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {40368#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:27,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {40368#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:27,882 INFO L290 TraceCheckUtils]: 76: Hoare triple {40369#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:27,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {40369#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:27,882 INFO L290 TraceCheckUtils]: 78: Hoare triple {40370#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {40370#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40371#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {40371#(<= main_~i~0 37)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:27,883 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 05:58:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:27,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679584846] [2022-04-15 05:58:27,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679584846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:27,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720883682] [2022-04-15 05:58:27,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:27,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:27,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:27,886 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:27,888 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,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:28,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:28,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 05:58:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:28,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40329#true} is VALID [2022-04-15 05:58:28,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#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(10, 2); {40329#true} is VALID [2022-04-15 05:58:28,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 05:58:28,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 05:58:28,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 05:58:28,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40391#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:28,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {40391#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40391#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:28,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {40391#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {40335#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40335#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {40335#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {40336#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40336#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {40336#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {40337#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40337#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {40337#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {40338#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40338#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {40338#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {40339#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40339#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {40339#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {40340#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40340#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {40340#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {40341#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40341#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {40341#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {40342#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40342#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {40342#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {40343#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40343#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {40343#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {40344#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40344#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {40344#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {40345#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40345#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {40345#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {40346#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40346#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {40346#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {40347#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40347#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {40347#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {40348#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40348#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {40348#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {40349#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40349#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {40349#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {40350#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40350#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {40350#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {40351#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40351#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {40351#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {40352#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40352#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {40352#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {40353#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40353#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {40353#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {40354#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40354#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {40354#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {40355#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40355#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {40355#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {40356#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40356#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {40356#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {40357#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40357#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {40357#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {40358#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40358#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {40358#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {40359#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40359#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {40359#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,636 INFO L290 TraceCheckUtils]: 58: Hoare triple {40360#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40360#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {40360#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {40361#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40361#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {40361#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {40362#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40362#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {40362#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {40363#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40363#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {40363#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,639 INFO L290 TraceCheckUtils]: 66: Hoare triple {40364#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40364#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,639 INFO L290 TraceCheckUtils]: 67: Hoare triple {40364#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,639 INFO L290 TraceCheckUtils]: 68: Hoare triple {40365#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40365#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {40365#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {40366#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40366#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,640 INFO L290 TraceCheckUtils]: 71: Hoare triple {40366#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {40367#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40367#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {40367#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {40368#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40368#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {40368#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,642 INFO L290 TraceCheckUtils]: 76: Hoare triple {40369#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40369#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,642 INFO L290 TraceCheckUtils]: 77: Hoare triple {40369#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {40370#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40370#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {40370#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40371#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:28,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {40371#(<= main_~i~0 37)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 05:58:28,644 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 05:58:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:28,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 93: Hoare triple {40330#false} assume !false; {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 92: Hoare triple {40330#false} assume 0 == ~cond; {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 91: Hoare triple {40330#false} ~cond := #in~cond; {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L272 TraceCheckUtils]: 90: Hoare triple {40330#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {40330#false} assume !(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:30,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {40330#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {40330#false} assume !!(0 != #t~mem4);havoc #t~mem4; {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {40330#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {40330#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {40330#false} is VALID [2022-04-15 05:58:30,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {40695#(< main_~i~0 1023)} assume !(~i~0 < 1023); {40330#false} is VALID [2022-04-15 05:58:30,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {40699#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40695#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:30,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {40699#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40699#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:30,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {40706#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40699#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:30,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {40706#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40706#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:30,518 INFO L290 TraceCheckUtils]: 75: Hoare triple {40713#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40706#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:30,518 INFO L290 TraceCheckUtils]: 74: Hoare triple {40713#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40713#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:30,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {40720#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40713#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:30,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {40720#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40720#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:30,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {40727#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40720#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:30,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {40727#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40727#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:30,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {40734#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40727#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:30,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {40734#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40734#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:30,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {40741#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40734#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:30,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {40741#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40741#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:30,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {40748#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40741#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:30,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {40748#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40748#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:30,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {40755#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40748#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:30,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {40755#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40755#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:30,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {40762#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40755#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:30,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {40762#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40762#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:30,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {40769#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40762#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:30,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {40769#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40769#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:30,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {40776#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40769#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:30,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {40776#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40776#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:30,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {40783#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40776#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:30,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {40783#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40783#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:30,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {40790#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40783#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:30,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {40790#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40790#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:30,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {40797#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40790#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:30,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {40797#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40797#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:30,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {40804#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40797#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:30,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {40804#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40804#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:30,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {40811#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40804#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:30,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {40811#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40811#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:30,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {40818#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40811#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:30,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {40818#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40818#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:30,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {40825#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40818#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:30,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {40825#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40825#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:30,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {40832#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40825#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:30,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {40832#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40832#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:30,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {40839#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40832#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:30,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {40839#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40839#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:30,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {40846#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40839#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:30,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {40846#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40846#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:30,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {40853#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40846#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:30,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {40853#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40853#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:30,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {40860#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40853#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:30,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {40860#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40860#(< main_~i~0 999)} is VALID [2022-04-15 05:58:30,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {40867#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40860#(< main_~i~0 999)} is VALID [2022-04-15 05:58:30,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {40867#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40867#(< main_~i~0 998)} is VALID [2022-04-15 05:58:30,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {40874#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40867#(< main_~i~0 998)} is VALID [2022-04-15 05:58:30,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {40874#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40874#(< main_~i~0 997)} is VALID [2022-04-15 05:58:30,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {40881#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40874#(< main_~i~0 997)} is VALID [2022-04-15 05:58:30,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {40881#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40881#(< main_~i~0 996)} is VALID [2022-04-15 05:58:30,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {40888#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40881#(< main_~i~0 996)} is VALID [2022-04-15 05:58:30,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {40888#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40888#(< main_~i~0 995)} is VALID [2022-04-15 05:58:30,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {40895#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40888#(< main_~i~0 995)} is VALID [2022-04-15 05:58:30,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {40895#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40895#(< main_~i~0 994)} is VALID [2022-04-15 05:58:30,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {40902#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40895#(< main_~i~0 994)} is VALID [2022-04-15 05:58:30,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {40902#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40902#(< main_~i~0 993)} is VALID [2022-04-15 05:58:30,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {40909#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40902#(< main_~i~0 993)} is VALID [2022-04-15 05:58:30,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {40909#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40909#(< main_~i~0 992)} is VALID [2022-04-15 05:58:30,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {40916#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40909#(< main_~i~0 992)} is VALID [2022-04-15 05:58:30,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {40916#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40916#(< main_~i~0 991)} is VALID [2022-04-15 05:58:30,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {40923#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40916#(< main_~i~0 991)} is VALID [2022-04-15 05:58:30,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {40923#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40923#(< main_~i~0 990)} is VALID [2022-04-15 05:58:30,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {40930#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40923#(< main_~i~0 990)} is VALID [2022-04-15 05:58:30,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {40930#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40930#(< main_~i~0 989)} is VALID [2022-04-15 05:58:30,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {40937#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40930#(< main_~i~0 989)} is VALID [2022-04-15 05:58:30,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {40937#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40937#(< main_~i~0 988)} is VALID [2022-04-15 05:58:30,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {40944#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40937#(< main_~i~0 988)} is VALID [2022-04-15 05:58:30,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {40944#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40944#(< main_~i~0 987)} is VALID [2022-04-15 05:58:30,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {40951#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40944#(< main_~i~0 987)} is VALID [2022-04-15 05:58:30,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {40951#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40951#(< main_~i~0 986)} is VALID [2022-04-15 05:58:30,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {40329#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40951#(< main_~i~0 986)} is VALID [2022-04-15 05:58:30,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {40329#true} call #t~ret5 := main(); {40329#true} is VALID [2022-04-15 05:58:30,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40329#true} {40329#true} #58#return; {40329#true} is VALID [2022-04-15 05:58:30,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {40329#true} assume true; {40329#true} is VALID [2022-04-15 05:58:30,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {40329#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(10, 2); {40329#true} is VALID [2022-04-15 05:58:30,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {40329#true} call ULTIMATE.init(); {40329#true} is VALID [2022-04-15 05:58:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:30,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720883682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:30,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:30,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 05:58:30,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:30,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [104628697] [2022-04-15 05:58:30,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [104628697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:30,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:30,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 05:58:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544002030] [2022-04-15 05:58:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 05:58:30,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:30,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call 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,610 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:58:30,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 05:58:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 05:58:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 05:58:30,612 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call 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:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:35,323 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2022-04-15 05:58:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 05:58:35,323 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 05:58:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call 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:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 290 transitions. [2022-04-15 05:58:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call 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:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 290 transitions. [2022-04-15 05:58:35,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 290 transitions. [2022-04-15 05:58:35,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:35,539 INFO L225 Difference]: With dead ends: 257 [2022-04-15 05:58:35,540 INFO L226 Difference]: Without dead ends: 243 [2022-04-15 05:58:35,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 151 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:35,541 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 544 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:35,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 36 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-15 05:58:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 97. [2022-04-15 05:58:35,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:35,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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:35,960 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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:35,960 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:35,962 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2022-04-15 05:58:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2022-04-15 05:58:35,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:35,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:35,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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 243 states. [2022-04-15 05:58:35,963 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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 243 states. [2022-04-15 05:58:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:35,967 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2022-04-15 05:58:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2022-04-15 05:58:35,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:35,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:35,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:35,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 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:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 05:58:35,969 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2022-04-15 05:58:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:35,969 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 05:58:35,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call 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:35,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 05:58:36,138 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:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 05:58:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 05:58:36,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:36,139 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:36,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-15 05:58:36,343 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:36,343 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash -82343749, now seen corresponding path program 77 times [2022-04-15 05:58:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400007208] [2022-04-15 05:58:36,347 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:36,347 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:36,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -82343749, now seen corresponding path program 78 times [2022-04-15 05:58:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:36,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492602652] [2022-04-15 05:58:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:37,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {42289#(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(10, 2); {42245#true} is VALID [2022-04-15 05:58:37,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 05:58:37,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 05:58:37,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:37,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {42289#(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(10, 2); {42245#true} is VALID [2022-04-15 05:58:37,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 05:58:37,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 05:58:37,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 05:58:37,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42250#(= main_~i~0 0)} is VALID [2022-04-15 05:58:37,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {42250#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42250#(= main_~i~0 0)} is VALID [2022-04-15 05:58:37,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {42250#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:37,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {42251#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:37,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {42251#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:37,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {42252#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:37,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {42252#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42253#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:37,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {42253#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42253#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:37,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {42253#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42254#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:37,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {42254#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42254#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:37,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {42254#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42255#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:37,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {42255#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42255#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:37,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {42255#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42256#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:37,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {42256#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42256#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:37,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {42256#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42257#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:37,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {42257#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42257#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:37,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {42257#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42258#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:37,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {42258#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42258#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:37,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {42258#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42259#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:37,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {42259#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42259#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:37,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {42259#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42260#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:37,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {42260#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42260#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:37,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {42260#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42261#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:37,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {42261#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42261#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:37,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {42261#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42262#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:37,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {42262#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42262#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:37,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {42262#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42263#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:37,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {42263#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42263#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:37,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {42263#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42264#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:37,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {42264#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42264#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:37,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {42264#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42265#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:37,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {42265#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42265#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:37,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {42265#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42266#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:37,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {42266#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42266#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:37,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {42266#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42267#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:37,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {42267#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42267#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:37,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {42267#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42268#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:37,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {42268#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42268#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:37,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {42268#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42269#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:37,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {42269#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42269#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:37,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {42269#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42270#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:37,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {42270#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42270#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:37,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {42270#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42271#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:37,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {42271#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42271#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:37,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {42271#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42272#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:37,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {42272#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42272#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:37,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {42272#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42273#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:37,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {42273#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42273#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:37,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {42273#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42274#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:37,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {42274#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42274#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:37,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {42274#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42275#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:37,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {42275#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42275#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:37,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {42275#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42276#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:37,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {42276#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42276#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:37,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {42276#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42277#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:37,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {42277#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42277#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:37,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {42277#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42278#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:37,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {42278#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42278#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:37,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {42278#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42279#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:37,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {42279#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42279#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:37,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {42279#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42280#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:37,068 INFO L290 TraceCheckUtils]: 66: Hoare triple {42280#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42280#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:37,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {42280#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42281#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:37,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {42281#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42281#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:37,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {42281#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42282#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:37,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {42282#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42282#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:37,069 INFO L290 TraceCheckUtils]: 71: Hoare triple {42282#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42283#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:37,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {42283#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42283#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:37,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {42283#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42284#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:37,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {42284#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42284#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:37,071 INFO L290 TraceCheckUtils]: 75: Hoare triple {42284#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42285#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:37,071 INFO L290 TraceCheckUtils]: 76: Hoare triple {42285#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42285#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:37,071 INFO L290 TraceCheckUtils]: 77: Hoare triple {42285#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42286#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:37,072 INFO L290 TraceCheckUtils]: 78: Hoare triple {42286#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42286#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:37,072 INFO L290 TraceCheckUtils]: 79: Hoare triple {42286#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42287#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:37,072 INFO L290 TraceCheckUtils]: 80: Hoare triple {42287#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42287#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {42287#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42288#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {42288#(<= main_~i~0 38)} assume !(~i~0 < 1023); {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 83: Hoare triple {42246#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 84: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {42246#false} assume !!(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 86: Hoare triple {42246#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 87: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {42246#false} assume !!(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {42246#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42246#false} is VALID [2022-04-15 05:58:37,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {42246#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L290 TraceCheckUtils]: 91: Hoare triple {42246#false} assume !(0 != #t~mem4);havoc #t~mem4; {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L272 TraceCheckUtils]: 92: Hoare triple {42246#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L290 TraceCheckUtils]: 93: Hoare triple {42246#false} ~cond := #in~cond; {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L290 TraceCheckUtils]: 94: Hoare triple {42246#false} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 05:58:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492602652] [2022-04-15 05:58:37,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492602652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410625816] [2022-04-15 05:58:37,075 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:37,076 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:37,076 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:37,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:58:37,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:37,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:58:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:37,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:37,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#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(10, 2); {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 68: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 69: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 70: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 71: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {42245#true} assume !(~i~0 < 1023); {42245#true} is VALID [2022-04-15 05:58:37,526 INFO L290 TraceCheckUtils]: 83: Hoare triple {42245#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42542#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:37,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {42542#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42542#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:37,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {42542#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {42542#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:37,527 INFO L290 TraceCheckUtils]: 86: Hoare triple {42542#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:37,527 INFO L290 TraceCheckUtils]: 87: Hoare triple {42251#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42251#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:37,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {42251#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {42251#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:37,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {42251#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:37,528 INFO L290 TraceCheckUtils]: 90: Hoare triple {42252#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42252#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:37,528 INFO L290 TraceCheckUtils]: 91: Hoare triple {42252#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {42252#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:37,529 INFO L272 TraceCheckUtils]: 92: Hoare triple {42252#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:37,529 INFO L290 TraceCheckUtils]: 93: Hoare triple {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:37,529 INFO L290 TraceCheckUtils]: 94: Hoare triple {42574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 05:58:37,529 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 05:58:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 05:58:37,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:37,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {42246#false} assume !false; {42246#false} is VALID [2022-04-15 05:58:37,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {42574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42246#false} is VALID [2022-04-15 05:58:37,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:37,796 INFO L272 TraceCheckUtils]: 92: Hoare triple {42590#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {42570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:37,796 INFO L290 TraceCheckUtils]: 91: Hoare triple {42590#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:37,796 INFO L290 TraceCheckUtils]: 90: Hoare triple {42590#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:37,797 INFO L290 TraceCheckUtils]: 89: Hoare triple {42600#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42590#(<= main_~i~0 1024)} is VALID [2022-04-15 05:58:37,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {42600#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:37,797 INFO L290 TraceCheckUtils]: 87: Hoare triple {42600#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:37,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {42610#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42600#(<= main_~i~0 1023)} is VALID [2022-04-15 05:58:37,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {42610#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:37,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {42610#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {42245#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {42610#(<= main_~i~0 1022)} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {42245#true} assume !(~i~0 < 1023); {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 75: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {42245#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {42245#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {42245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {42245#true} call #t~ret5 := main(); {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42245#true} {42245#true} #58#return; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {42245#true} assume true; {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {42245#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(10, 2); {42245#true} is VALID [2022-04-15 05:58:37,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {42245#true} call ULTIMATE.init(); {42245#true} is VALID [2022-04-15 05:58:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 05:58:37,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410625816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:37,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:37,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 7, 7] total 48 [2022-04-15 05:58:37,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:37,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400007208] [2022-04-15 05:58:37,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400007208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:37,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:37,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 05:58:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605888182] [2022-04-15 05:58:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 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 96 [2022-04-15 05:58:37,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:37,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call 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,864 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:58:37,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 05:58:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:37,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 05:58:37,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=1260, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:58:37,865 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call 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:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:42,976 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2022-04-15 05:58:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 05:58:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 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 96 [2022-04-15 05:58:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call 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:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2022-04-15 05:58:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call 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:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2022-04-15 05:58:42,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 297 transitions. [2022-04-15 05:58:43,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:43,194 INFO L225 Difference]: With dead ends: 263 [2022-04-15 05:58:43,194 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 05:58:43,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2752, Invalid=4730, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 05:58:43,195 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 505 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:43,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 31 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 05:58:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 99. [2022-04-15 05:58:43,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:43,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:43,634 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:43,634 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:43,637 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2022-04-15 05:58:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2022-04-15 05:58:43,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:43,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:43,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 05:58:43,637 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 05:58:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:43,641 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2022-04-15 05:58:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2022-04-15 05:58:43,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:43,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:43,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:43,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:58:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 05:58:43,642 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2022-04-15 05:58:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:43,642 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 05:58:43,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call 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:43,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 05:58:43,816 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:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 05:58:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 05:58:43,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:43,816 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:43,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 05:58:44,019 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:44,020 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 709690589, now seen corresponding path program 79 times [2022-04-15 05:58:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:44,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125465663] [2022-04-15 05:58:44,023 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:44,024 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:44,024 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 709690589, now seen corresponding path program 80 times [2022-04-15 05:58:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:44,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908458452] [2022-04-15 05:58:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:44,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {44216#(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(10, 2); {44171#true} is VALID [2022-04-15 05:58:44,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 05:58:44,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 05:58:44,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:44,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {44216#(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(10, 2); {44171#true} is VALID [2022-04-15 05:58:44,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 05:58:44,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 05:58:44,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 05:58:44,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44176#(= main_~i~0 0)} is VALID [2022-04-15 05:58:44,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {44176#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44176#(= main_~i~0 0)} is VALID [2022-04-15 05:58:44,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {44176#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:44,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {44177#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:44,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {44177#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:44,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {44178#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:44,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {44178#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:44,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {44179#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:44,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {44179#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:44,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {44180#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:44,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {44180#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:44,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {44181#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:44,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {44181#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:44,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {44182#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:44,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {44182#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:44,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {44183#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:44,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {44183#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:44,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {44184#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:44,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {44184#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:44,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {44185#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:44,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {44185#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:44,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {44186#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:44,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {44186#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:44,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {44187#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:44,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {44187#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:44,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {44188#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:44,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {44188#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:44,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {44189#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:44,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {44189#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:44,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {44190#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:44,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {44190#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:44,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {44191#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:44,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {44191#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:44,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {44192#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:44,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {44192#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:44,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {44193#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:44,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {44193#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:44,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {44194#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:44,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {44194#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:44,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {44195#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:44,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {44195#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:44,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {44196#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:44,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {44196#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:44,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {44197#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:44,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {44197#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:44,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {44198#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:44,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {44198#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:44,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {44199#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:44,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {44199#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:44,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {44200#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:44,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {44200#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:44,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {44201#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:44,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {44201#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:44,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {44202#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:44,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {44202#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:44,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {44203#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:44,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {44203#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:44,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {44204#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:44,763 INFO L290 TraceCheckUtils]: 63: Hoare triple {44204#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:44,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {44205#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:44,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {44205#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:44,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {44206#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:44,765 INFO L290 TraceCheckUtils]: 67: Hoare triple {44206#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:44,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {44207#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:44,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {44207#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:44,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {44208#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:44,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {44208#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:44,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {44209#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:44,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {44209#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:44,767 INFO L290 TraceCheckUtils]: 74: Hoare triple {44210#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:44,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {44210#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:44,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {44211#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:44,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {44211#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:44,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {44212#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:44,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {44212#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:44,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {44213#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:44,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {44213#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:44,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {44214#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {44214#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44215#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {44215#(<= main_~i~0 39)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:44,770 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 05:58:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:44,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908458452] [2022-04-15 05:58:44,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908458452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:44,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951193033] [2022-04-15 05:58:44,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:58:44,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:44,773 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:44,773 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:45,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:58:45,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:45,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 05:58:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:45,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:45,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44171#true} is VALID [2022-04-15 05:58:45,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#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(10, 2); {44171#true} is VALID [2022-04-15 05:58:45,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 05:58:45,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 05:58:45,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 05:58:45,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44235#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:45,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {44235#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44235#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:45,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {44235#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:45,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {44177#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44177#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:45,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {44177#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:45,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {44178#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44178#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:45,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {44178#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:45,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {44179#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44179#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:45,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {44179#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:45,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {44180#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44180#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:45,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {44180#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:45,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {44181#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44181#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:45,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {44181#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:45,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {44182#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44182#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:45,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {44182#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:45,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {44183#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44183#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:45,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {44183#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:45,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {44184#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44184#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:45,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {44184#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:45,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {44185#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44185#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:45,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {44185#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:45,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {44186#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44186#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:45,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {44186#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:45,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {44187#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44187#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:45,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {44187#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:45,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {44188#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44188#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:45,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {44188#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:45,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {44189#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44189#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:45,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {44189#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:45,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {44190#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44190#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:45,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {44190#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:45,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {44191#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44191#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:45,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {44191#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:45,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {44192#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44192#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:45,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {44192#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:45,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {44193#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44193#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:45,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {44193#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:45,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {44194#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44194#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:45,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {44194#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:45,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {44195#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44195#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:45,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {44195#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:45,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {44196#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44196#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:45,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {44196#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:45,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {44197#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44197#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:45,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {44197#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:45,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {44198#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44198#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:45,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {44198#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:45,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {44199#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44199#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:45,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {44199#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:45,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {44200#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44200#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:45,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {44200#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:45,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {44201#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44201#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:45,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {44201#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:45,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {44202#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44202#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:45,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {44202#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:45,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {44203#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44203#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:45,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {44203#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:45,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {44204#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44204#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:45,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {44204#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:45,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {44205#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44205#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:45,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {44205#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:45,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {44206#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44206#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:45,670 INFO L290 TraceCheckUtils]: 67: Hoare triple {44206#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:45,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {44207#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44207#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:45,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {44207#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:45,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {44208#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44208#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:45,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {44208#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:45,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {44209#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44209#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:45,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {44209#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:45,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {44210#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44210#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:45,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {44210#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:45,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {44211#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44211#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:45,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {44211#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:45,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {44212#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44212#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:45,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {44212#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:45,674 INFO L290 TraceCheckUtils]: 80: Hoare triple {44213#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44213#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:45,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {44213#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 82: Hoare triple {44214#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44214#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 83: Hoare triple {44214#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44215#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 84: Hoare triple {44215#(<= main_~i~0 39)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:45,675 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 05:58:45,676 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 05:58:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:45,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {44172#false} assume !false; {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 96: Hoare triple {44172#false} assume 0 == ~cond; {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 95: Hoare triple {44172#false} ~cond := #in~cond; {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L272 TraceCheckUtils]: 94: Hoare triple {44172#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 93: Hoare triple {44172#false} assume !(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 92: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:47,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 89: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {44172#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {44172#false} assume !!(0 != #t~mem4);havoc #t~mem4; {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {44172#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {44172#false} is VALID [2022-04-15 05:58:47,722 INFO L290 TraceCheckUtils]: 85: Hoare triple {44172#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {44172#false} is VALID [2022-04-15 05:58:47,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {44551#(< main_~i~0 1023)} assume !(~i~0 < 1023); {44172#false} is VALID [2022-04-15 05:58:47,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {44555#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44551#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:47,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {44555#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44555#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:47,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {44562#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44555#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:47,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {44562#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44562#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:47,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {44569#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44562#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:47,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {44569#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44569#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:47,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {44576#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44569#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:47,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {44576#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44576#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:47,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {44583#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44576#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:47,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {44583#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44583#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:47,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {44590#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44583#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:47,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {44590#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44590#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:47,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {44597#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44590#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:47,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {44597#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44597#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:47,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {44604#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44597#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:47,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {44604#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44604#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:47,745 INFO L290 TraceCheckUtils]: 67: Hoare triple {44611#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44604#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:47,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {44611#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44611#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:47,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {44618#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44611#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:47,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {44618#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44618#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:47,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {44625#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44618#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:47,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {44625#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44625#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:47,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {44632#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44625#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:47,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {44632#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44632#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:47,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {44639#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44632#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:47,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {44639#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44639#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:47,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {44646#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44639#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:47,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {44646#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44646#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:47,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {44653#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44646#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:47,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {44653#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44653#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:47,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {44660#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44653#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:47,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {44660#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44660#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:47,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {44667#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44660#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:47,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {44667#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44667#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:47,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {44674#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44667#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:47,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {44674#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44674#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:47,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {44681#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44674#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:47,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {44681#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44681#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:47,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {44688#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44681#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:47,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {44688#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44688#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:47,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {44695#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44688#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:47,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {44695#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44695#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:47,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {44702#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44695#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:47,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {44702#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44702#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:47,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {44709#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44702#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:47,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {44709#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44709#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:47,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {44716#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44709#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:47,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {44716#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44716#(< main_~i~0 999)} is VALID [2022-04-15 05:58:47,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {44723#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44716#(< main_~i~0 999)} is VALID [2022-04-15 05:58:47,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {44723#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44723#(< main_~i~0 998)} is VALID [2022-04-15 05:58:47,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {44730#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44723#(< main_~i~0 998)} is VALID [2022-04-15 05:58:47,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {44730#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44730#(< main_~i~0 997)} is VALID [2022-04-15 05:58:47,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {44737#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44730#(< main_~i~0 997)} is VALID [2022-04-15 05:58:47,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {44737#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44737#(< main_~i~0 996)} is VALID [2022-04-15 05:58:47,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {44744#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44737#(< main_~i~0 996)} is VALID [2022-04-15 05:58:47,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {44744#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44744#(< main_~i~0 995)} is VALID [2022-04-15 05:58:47,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {44751#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44744#(< main_~i~0 995)} is VALID [2022-04-15 05:58:47,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {44751#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44751#(< main_~i~0 994)} is VALID [2022-04-15 05:58:47,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {44758#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44751#(< main_~i~0 994)} is VALID [2022-04-15 05:58:47,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {44758#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44758#(< main_~i~0 993)} is VALID [2022-04-15 05:58:47,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {44765#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44758#(< main_~i~0 993)} is VALID [2022-04-15 05:58:47,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {44765#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44765#(< main_~i~0 992)} is VALID [2022-04-15 05:58:47,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {44772#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44765#(< main_~i~0 992)} is VALID [2022-04-15 05:58:47,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {44772#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44772#(< main_~i~0 991)} is VALID [2022-04-15 05:58:47,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {44779#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44772#(< main_~i~0 991)} is VALID [2022-04-15 05:58:47,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {44779#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44779#(< main_~i~0 990)} is VALID [2022-04-15 05:58:47,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {44786#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44779#(< main_~i~0 990)} is VALID [2022-04-15 05:58:47,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {44786#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44786#(< main_~i~0 989)} is VALID [2022-04-15 05:58:47,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {44793#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44786#(< main_~i~0 989)} is VALID [2022-04-15 05:58:47,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {44793#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44793#(< main_~i~0 988)} is VALID [2022-04-15 05:58:47,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {44800#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44793#(< main_~i~0 988)} is VALID [2022-04-15 05:58:47,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {44800#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44800#(< main_~i~0 987)} is VALID [2022-04-15 05:58:47,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {44807#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44800#(< main_~i~0 987)} is VALID [2022-04-15 05:58:47,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {44807#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44807#(< main_~i~0 986)} is VALID [2022-04-15 05:58:47,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {44814#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44807#(< main_~i~0 986)} is VALID [2022-04-15 05:58:47,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {44814#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44814#(< main_~i~0 985)} is VALID [2022-04-15 05:58:47,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {44821#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44814#(< main_~i~0 985)} is VALID [2022-04-15 05:58:47,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {44821#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44821#(< main_~i~0 984)} is VALID [2022-04-15 05:58:47,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {44171#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44821#(< main_~i~0 984)} is VALID [2022-04-15 05:58:47,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {44171#true} call #t~ret5 := main(); {44171#true} is VALID [2022-04-15 05:58:47,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44171#true} {44171#true} #58#return; {44171#true} is VALID [2022-04-15 05:58:47,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {44171#true} assume true; {44171#true} is VALID [2022-04-15 05:58:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {44171#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(10, 2); {44171#true} is VALID [2022-04-15 05:58:47,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {44171#true} call ULTIMATE.init(); {44171#true} is VALID [2022-04-15 05:58:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951193033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:47,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 05:58:47,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125465663] [2022-04-15 05:58:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125465663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 05:58:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984148124] [2022-04-15 05:58:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 05:58:47,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:47,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call 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:47,849 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:58:47,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 05:58:47,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 05:58:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 05:58:47,851 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call 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:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:53,254 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2022-04-15 05:58:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 05:58:53,254 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 05:58:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call 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:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 304 transitions. [2022-04-15 05:58:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call 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:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 304 transitions. [2022-04-15 05:58:53,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 304 transitions. [2022-04-15 05:58:53,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:53,478 INFO L225 Difference]: With dead ends: 269 [2022-04-15 05:58:53,478 INFO L226 Difference]: Without dead ends: 255 [2022-04-15 05:58:53,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 05:58:53,480 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 585 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:53,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 41 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-15 05:58:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 101. [2022-04-15 05:58:53,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:53,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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:53,986 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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:53,987 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:53,990 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2022-04-15 05:58:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2022-04-15 05:58:53,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:53,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:53,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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 255 states. [2022-04-15 05:58:53,991 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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 255 states. [2022-04-15 05:58:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:53,995 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2022-04-15 05:58:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2022-04-15 05:58:53,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:53,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:53,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:53,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-04-15 05:58:53,997 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2022-04-15 05:58:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:53,997 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-04-15 05:58:53,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call 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:53,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 102 transitions. [2022-04-15 05:58:54,198 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:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 05:58:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 05:58:54,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:54,199 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:54,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-15 05:58:54,399 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:54,400 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1645478015, now seen corresponding path program 81 times [2022-04-15 05:58:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:54,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26000160] [2022-04-15 05:58:54,404 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:54,404 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:54,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1645478015, now seen corresponding path program 82 times [2022-04-15 05:58:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:54,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579374554] [2022-04-15 05:58:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:55,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {46221#(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(10, 2); {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:55,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {46221#(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(10, 2); {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 05:58:55,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 05:58:55,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46180#(= main_~i~0 0)} is VALID [2022-04-15 05:58:55,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {46180#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46180#(= main_~i~0 0)} is VALID [2022-04-15 05:58:55,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {46180#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:55,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {46181#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:55,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {46181#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:55,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {46182#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:55,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {46182#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:55,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {46183#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:55,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {46183#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:55,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {46184#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:55,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {46184#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:55,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {46185#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:55,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {46185#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:55,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:55,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:55,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {46187#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:55,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {46187#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:55,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {46188#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:55,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {46188#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:55,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {46189#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:55,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {46189#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:55,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {46190#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:55,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {46190#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:55,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {46191#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:55,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {46191#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:55,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {46192#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:55,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {46192#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:55,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {46193#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:55,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {46193#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:55,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {46194#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:55,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {46194#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:55,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {46195#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:55,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {46195#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:55,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {46196#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:55,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {46196#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:55,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {46197#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:55,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {46197#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:55,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {46198#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:55,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {46198#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:55,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {46199#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:55,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {46199#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:55,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {46200#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:55,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {46200#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:55,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {46201#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:55,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {46201#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:55,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {46202#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:55,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {46202#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:55,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {46203#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:55,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {46203#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:55,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {46204#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:55,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {46204#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:55,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {46205#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:55,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {46205#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:55,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {46206#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:55,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {46206#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:55,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {46207#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:55,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {46207#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:55,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {46208#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:55,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {46208#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:55,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {46209#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:55,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {46209#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:55,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {46210#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:55,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {46210#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:55,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {46211#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:55,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {46211#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:55,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {46212#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:55,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {46212#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:55,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {46213#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:55,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {46213#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:55,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {46214#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:55,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {46214#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:55,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {46215#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:55,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {46215#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:55,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {46216#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:55,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {46216#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:55,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {46217#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:55,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {46217#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:55,165 INFO L290 TraceCheckUtils]: 82: Hoare triple {46218#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:55,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {46218#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:55,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {46219#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {46219#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {46220#(<= main_~i~0 40)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:55,166 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 05:58:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:55,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579374554] [2022-04-15 05:58:55,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579374554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:55,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321875295] [2022-04-15 05:58:55,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:55,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:55,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:55,169 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:55,183 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:55,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:55,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:55,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 05:58:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:55,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:55,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46175#true} is VALID [2022-04-15 05:58:55,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#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(10, 2); {46175#true} is VALID [2022-04-15 05:58:55,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 05:58:55,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 05:58:55,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 05:58:55,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46240#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:55,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {46240#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46240#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:55,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {46240#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:55,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {46181#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46181#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:55,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {46181#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:55,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {46182#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46182#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:55,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {46182#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:55,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {46183#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46183#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:55,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {46183#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:55,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {46184#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46184#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:55,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {46184#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:55,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {46185#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46185#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:55,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {46185#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:55,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46186#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:55,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:55,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {46187#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46187#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:55,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {46187#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:55,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {46188#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46188#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:56,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {46188#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:56,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {46189#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46189#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:56,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {46189#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:56,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {46190#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46190#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:56,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {46190#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:56,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {46191#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46191#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:56,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {46191#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:56,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {46192#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46192#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:56,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {46192#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:56,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {46193#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46193#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:56,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {46193#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:56,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {46194#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46194#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:56,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {46194#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:56,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {46195#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46195#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:56,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {46195#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:56,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {46196#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46196#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:56,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {46196#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:56,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {46197#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46197#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:56,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {46197#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:56,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {46198#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46198#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:56,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {46198#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:56,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {46199#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46199#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:56,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {46199#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:56,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {46200#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46200#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:56,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {46200#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:56,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {46201#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46201#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:56,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {46201#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:56,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {46202#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46202#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:56,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {46202#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:56,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {46203#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46203#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:56,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {46203#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:56,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {46204#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46204#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:56,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {46204#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:56,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {46205#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46205#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:56,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {46205#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:56,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {46206#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46206#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:56,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {46206#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:56,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {46207#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46207#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:56,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {46207#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:56,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {46208#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46208#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:56,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {46208#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:56,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {46209#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46209#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:56,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {46209#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:56,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {46210#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46210#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:56,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {46210#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:56,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {46211#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46211#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:56,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {46211#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:56,017 INFO L290 TraceCheckUtils]: 70: Hoare triple {46212#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46212#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:56,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {46212#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:56,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {46213#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46213#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:56,018 INFO L290 TraceCheckUtils]: 73: Hoare triple {46213#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:56,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {46214#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46214#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:56,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {46214#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:56,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {46215#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46215#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:56,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {46215#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:56,019 INFO L290 TraceCheckUtils]: 78: Hoare triple {46216#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46216#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:56,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {46216#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:56,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {46217#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46217#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:56,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {46217#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:56,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {46218#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46218#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:56,021 INFO L290 TraceCheckUtils]: 83: Hoare triple {46218#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:56,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {46219#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46219#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 85: Hoare triple {46219#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46220#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {46220#(<= main_~i~0 40)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:56,022 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 05:58:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:56,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:58,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {46176#false} assume !false; {46176#false} is VALID [2022-04-15 05:58:58,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {46176#false} assume 0 == ~cond; {46176#false} is VALID [2022-04-15 05:58:58,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {46176#false} ~cond := #in~cond; {46176#false} is VALID [2022-04-15 05:58:58,165 INFO L272 TraceCheckUtils]: 96: Hoare triple {46176#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {46176#false} is VALID [2022-04-15 05:58:58,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {46176#false} assume !(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:58,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 93: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 92: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {46176#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {46176#false} assume !!(0 != #t~mem4);havoc #t~mem4; {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {46176#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 87: Hoare triple {46176#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {46176#false} is VALID [2022-04-15 05:58:58,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {46562#(< main_~i~0 1023)} assume !(~i~0 < 1023); {46176#false} is VALID [2022-04-15 05:58:58,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {46566#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46562#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:58,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {46566#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46566#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:58,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {46573#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46566#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:58,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {46573#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46573#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:58,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {46580#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46573#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:58,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {46580#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46580#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:58,169 INFO L290 TraceCheckUtils]: 79: Hoare triple {46587#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46580#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:58,169 INFO L290 TraceCheckUtils]: 78: Hoare triple {46587#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46587#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:58,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {46594#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46587#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:58,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {46594#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46594#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:58,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {46601#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46594#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:58,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {46601#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46601#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:58,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {46608#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46601#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:58,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {46608#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46608#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:58,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {46615#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46608#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:58,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {46615#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46615#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:58,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {46622#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46615#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:58,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {46622#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46622#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:58,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {46629#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46622#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:58,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {46629#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46629#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:58,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {46636#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46629#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:58,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {46636#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46636#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:58,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {46643#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46636#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:58,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {46643#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46643#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:58,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {46650#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46643#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:58,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {46650#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46650#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:58,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {46657#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46650#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:58,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {46657#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46657#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:58,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {46664#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46657#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:58,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {46664#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46664#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:58,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {46671#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46664#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:58,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {46671#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46671#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:58,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {46678#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46671#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:58,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {46678#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46678#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:58,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {46685#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46678#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:58,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {46685#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46685#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:58,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {46692#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46685#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:58,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {46692#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46692#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:58,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {46699#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46692#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:58,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {46699#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46699#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:58,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {46706#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46699#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:58,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {46706#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46706#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:58,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {46713#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46706#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:58,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {46713#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46713#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:58,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {46720#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46713#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:58,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {46720#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46720#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:58,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {46727#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46720#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:58,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {46727#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46727#(< main_~i~0 999)} is VALID [2022-04-15 05:58:58,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {46734#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46727#(< main_~i~0 999)} is VALID [2022-04-15 05:58:58,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {46734#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46734#(< main_~i~0 998)} is VALID [2022-04-15 05:58:58,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {46741#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46734#(< main_~i~0 998)} is VALID [2022-04-15 05:58:58,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {46741#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46741#(< main_~i~0 997)} is VALID [2022-04-15 05:58:58,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {46748#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46741#(< main_~i~0 997)} is VALID [2022-04-15 05:58:58,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {46748#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46748#(< main_~i~0 996)} is VALID [2022-04-15 05:58:58,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {46755#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46748#(< main_~i~0 996)} is VALID [2022-04-15 05:58:58,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {46755#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46755#(< main_~i~0 995)} is VALID [2022-04-15 05:58:58,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {46762#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46755#(< main_~i~0 995)} is VALID [2022-04-15 05:58:58,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {46762#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46762#(< main_~i~0 994)} is VALID [2022-04-15 05:58:58,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {46769#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46762#(< main_~i~0 994)} is VALID [2022-04-15 05:58:58,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {46769#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46769#(< main_~i~0 993)} is VALID [2022-04-15 05:58:58,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {46776#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46769#(< main_~i~0 993)} is VALID [2022-04-15 05:58:58,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {46776#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46776#(< main_~i~0 992)} is VALID [2022-04-15 05:58:58,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {46783#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46776#(< main_~i~0 992)} is VALID [2022-04-15 05:58:58,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {46783#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46783#(< main_~i~0 991)} is VALID [2022-04-15 05:58:58,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {46790#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46783#(< main_~i~0 991)} is VALID [2022-04-15 05:58:58,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {46790#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46790#(< main_~i~0 990)} is VALID [2022-04-15 05:58:58,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {46797#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46790#(< main_~i~0 990)} is VALID [2022-04-15 05:58:58,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {46797#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46797#(< main_~i~0 989)} is VALID [2022-04-15 05:58:58,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {46804#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46797#(< main_~i~0 989)} is VALID [2022-04-15 05:58:58,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {46804#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46804#(< main_~i~0 988)} is VALID [2022-04-15 05:58:58,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {46811#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46804#(< main_~i~0 988)} is VALID [2022-04-15 05:58:58,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {46811#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46811#(< main_~i~0 987)} is VALID [2022-04-15 05:58:58,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {46818#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46811#(< main_~i~0 987)} is VALID [2022-04-15 05:58:58,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {46818#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46818#(< main_~i~0 986)} is VALID [2022-04-15 05:58:58,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {46825#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46818#(< main_~i~0 986)} is VALID [2022-04-15 05:58:58,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {46825#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46825#(< main_~i~0 985)} is VALID [2022-04-15 05:58:58,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {46832#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46825#(< main_~i~0 985)} is VALID [2022-04-15 05:58:58,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {46832#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46832#(< main_~i~0 984)} is VALID [2022-04-15 05:58:58,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {46839#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46832#(< main_~i~0 984)} is VALID [2022-04-15 05:58:58,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {46839#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46839#(< main_~i~0 983)} is VALID [2022-04-15 05:58:58,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {46175#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46839#(< main_~i~0 983)} is VALID [2022-04-15 05:58:58,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {46175#true} call #t~ret5 := main(); {46175#true} is VALID [2022-04-15 05:58:58,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46175#true} {46175#true} #58#return; {46175#true} is VALID [2022-04-15 05:58:58,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {46175#true} assume true; {46175#true} is VALID [2022-04-15 05:58:58,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {46175#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(10, 2); {46175#true} is VALID [2022-04-15 05:58:58,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {46175#true} call ULTIMATE.init(); {46175#true} is VALID [2022-04-15 05:58:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:58:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321875295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:58,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:58,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 05:58:58,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:58,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26000160] [2022-04-15 05:58:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26000160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:58,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:58,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 05:58:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582194152] [2022-04-15 05:58:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:58,195 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 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 100 [2022-04-15 05:58:58,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:58,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:58,256 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:58,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 05:58:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 05:58:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 05:58:58,258 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:03,974 INFO L93 Difference]: Finished difference Result 275 states and 316 transitions. [2022-04-15 05:59:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 05:59:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 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 100 [2022-04-15 05:59:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 311 transitions. [2022-04-15 05:59:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 311 transitions. [2022-04-15 05:59:03,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 311 transitions. [2022-04-15 05:59:04,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:04,214 INFO L225 Difference]: With dead ends: 275 [2022-04-15 05:59:04,215 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 05:59:04,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 05:59:04,216 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 643 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:04,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 36 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:59:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 05:59:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 103. [2022-04-15 05:59:04,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:04,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:04,721 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:04,721 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:04,724 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-04-15 05:59:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2022-04-15 05:59:04,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:04,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:04,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 05:59:04,724 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 05:59:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:04,729 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2022-04-15 05:59:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2022-04-15 05:59:04,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:04,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:04,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:04,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-15 05:59:04,731 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2022-04-15 05:59:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:04,732 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-15 05:59:04,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:04,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-15 05:59:04,915 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:59:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-15 05:59:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 05:59:04,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:04,915 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:04,934 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:05,119 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:05,119 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1005937759, now seen corresponding path program 83 times [2022-04-15 05:59:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:05,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438418020] [2022-04-15 05:59:05,126 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:05,126 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:05,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1005937759, now seen corresponding path program 84 times [2022-04-15 05:59:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:05,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086602991] [2022-04-15 05:59:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:05,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {48270#(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(10, 2); {48223#true} is VALID [2022-04-15 05:59:05,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 05:59:05,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 05:59:05,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:05,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {48270#(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(10, 2); {48223#true} is VALID [2022-04-15 05:59:05,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 05:59:05,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 05:59:05,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 05:59:05,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48228#(= main_~i~0 0)} is VALID [2022-04-15 05:59:05,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {48228#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48228#(= main_~i~0 0)} is VALID [2022-04-15 05:59:05,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {48228#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:05,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {48229#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:05,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {48229#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:05,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {48230#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:05,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {48230#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48231#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:05,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {48231#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48231#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:05,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {48231#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48232#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:05,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {48232#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48232#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:05,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {48232#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48233#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:05,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {48233#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48233#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:05,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {48233#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48234#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:05,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {48234#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48234#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:05,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {48234#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48235#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:05,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {48235#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48235#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:05,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {48235#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48236#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:05,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {48236#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48236#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:05,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {48236#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48237#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:05,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {48237#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48237#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:05,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {48237#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48238#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:05,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {48238#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48238#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:05,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {48238#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48239#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:05,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {48239#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48239#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:05,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {48239#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48240#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:05,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {48240#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48240#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:05,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {48240#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48241#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:05,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {48241#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48241#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:05,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {48241#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48242#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:05,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {48242#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48242#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:05,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {48242#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48243#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:05,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {48243#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48243#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:05,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {48243#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48244#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:05,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {48244#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48244#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:05,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {48244#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48245#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:05,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {48245#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48245#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:05,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {48245#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48246#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:05,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {48246#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48246#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:05,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {48246#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48247#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:05,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {48247#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48247#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:05,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {48247#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48248#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:05,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {48248#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48248#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:05,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {48248#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48249#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:05,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {48249#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48249#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:05,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {48249#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48250#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:05,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {48250#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48250#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:05,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {48250#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48251#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:05,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {48251#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48251#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:05,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {48251#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48252#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:05,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {48252#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48252#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:05,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {48252#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48253#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:05,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {48253#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48253#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:05,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {48253#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48254#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:05,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {48254#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48254#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:05,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {48254#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48255#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:05,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {48255#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48255#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:05,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {48255#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48256#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:05,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {48256#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48256#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:05,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {48256#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48257#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:05,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {48257#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48257#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:05,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {48257#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48258#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:05,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {48258#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48258#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:05,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {48258#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48259#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:05,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {48259#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48259#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:05,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {48259#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48260#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:05,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {48260#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48260#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:05,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {48260#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48261#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:05,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {48261#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48261#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:05,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {48261#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48262#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:05,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {48262#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48262#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:05,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {48262#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48263#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:05,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {48263#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48263#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:05,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {48263#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48264#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:05,888 INFO L290 TraceCheckUtils]: 78: Hoare triple {48264#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48264#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:05,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {48264#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48265#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:05,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {48265#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48265#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:05,889 INFO L290 TraceCheckUtils]: 81: Hoare triple {48265#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48266#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:05,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {48266#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48266#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:05,889 INFO L290 TraceCheckUtils]: 83: Hoare triple {48266#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48267#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:05,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {48267#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48267#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:05,890 INFO L290 TraceCheckUtils]: 85: Hoare triple {48267#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48268#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:05,890 INFO L290 TraceCheckUtils]: 86: Hoare triple {48268#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48268#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {48268#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48269#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {48269#(<= main_~i~0 41)} assume !(~i~0 < 1023); {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {48224#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 90: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 91: Hoare triple {48224#false} assume !!(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 92: Hoare triple {48224#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 93: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 94: Hoare triple {48224#false} assume !!(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 95: Hoare triple {48224#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 96: Hoare triple {48224#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48224#false} is VALID [2022-04-15 05:59:05,891 INFO L290 TraceCheckUtils]: 97: Hoare triple {48224#false} assume !(0 != #t~mem4);havoc #t~mem4; {48224#false} is VALID [2022-04-15 05:59:05,892 INFO L272 TraceCheckUtils]: 98: Hoare triple {48224#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48224#false} is VALID [2022-04-15 05:59:05,892 INFO L290 TraceCheckUtils]: 99: Hoare triple {48224#false} ~cond := #in~cond; {48224#false} is VALID [2022-04-15 05:59:05,892 INFO L290 TraceCheckUtils]: 100: Hoare triple {48224#false} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 05:59:05,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 05:59:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086602991] [2022-04-15 05:59:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086602991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569129800] [2022-04-15 05:59:05,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:05,894 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:05,895 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:06,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:59:06,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:06,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:59:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:06,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:06,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48223#true} is VALID [2022-04-15 05:59:06,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#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(10, 2); {48223#true} is VALID [2022-04-15 05:59:06,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 76: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 87: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,383 INFO L290 TraceCheckUtils]: 88: Hoare triple {48223#true} assume !(~i~0 < 1023); {48223#true} is VALID [2022-04-15 05:59:06,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {48223#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48541#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:06,384 INFO L290 TraceCheckUtils]: 90: Hoare triple {48541#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48541#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:06,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {48541#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {48541#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:06,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {48541#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:06,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {48229#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48229#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:06,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {48229#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {48229#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:06,386 INFO L290 TraceCheckUtils]: 95: Hoare triple {48229#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:06,386 INFO L290 TraceCheckUtils]: 96: Hoare triple {48230#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48230#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:06,386 INFO L290 TraceCheckUtils]: 97: Hoare triple {48230#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {48230#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:06,387 INFO L272 TraceCheckUtils]: 98: Hoare triple {48230#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:06,387 INFO L290 TraceCheckUtils]: 99: Hoare triple {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:06,387 INFO L290 TraceCheckUtils]: 100: Hoare triple {48573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 05:59:06,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 05:59:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 05:59:06,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:06,694 INFO L290 TraceCheckUtils]: 101: Hoare triple {48224#false} assume !false; {48224#false} is VALID [2022-04-15 05:59:06,695 INFO L290 TraceCheckUtils]: 100: Hoare triple {48573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48224#false} is VALID [2022-04-15 05:59:06,695 INFO L290 TraceCheckUtils]: 99: Hoare triple {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:06,695 INFO L272 TraceCheckUtils]: 98: Hoare triple {48589#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {48569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:06,696 INFO L290 TraceCheckUtils]: 97: Hoare triple {48589#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:06,696 INFO L290 TraceCheckUtils]: 96: Hoare triple {48589#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:06,696 INFO L290 TraceCheckUtils]: 95: Hoare triple {48599#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48589#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:06,697 INFO L290 TraceCheckUtils]: 94: Hoare triple {48599#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:06,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {48599#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:06,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {48609#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48599#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 91: Hoare triple {48609#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 90: Hoare triple {48609#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 89: Hoare triple {48223#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {48609#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 88: Hoare triple {48223#true} assume !(~i~0 < 1023); {48223#true} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 87: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 83: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,699 INFO L290 TraceCheckUtils]: 72: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 71: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {48223#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {48223#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {48223#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {48223#true} call #t~ret5 := main(); {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48223#true} {48223#true} #58#return; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {48223#true} assume true; {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {48223#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(10, 2); {48223#true} is VALID [2022-04-15 05:59:06,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {48223#true} call ULTIMATE.init(); {48223#true} is VALID [2022-04-15 05:59:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 05:59:06,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569129800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:06,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:06,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 7] total 51 [2022-04-15 05:59:06,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:06,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438418020] [2022-04-15 05:59:06,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438418020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:06,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:06,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 05:59:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265324216] [2022-04-15 05:59:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 05:59:06,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:06,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call 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:06,768 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:59:06,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 05:59:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 05:59:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=1416, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 05:59:06,770 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call 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:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:12,717 INFO L93 Difference]: Finished difference Result 281 states and 323 transitions. [2022-04-15 05:59:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 05:59:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 05:59:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call 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:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 318 transitions. [2022-04-15 05:59:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call 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:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 318 transitions. [2022-04-15 05:59:12,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 318 transitions. [2022-04-15 05:59:12,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:12,952 INFO L225 Difference]: With dead ends: 281 [2022-04-15 05:59:12,952 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 05:59:12,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 199 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:12,956 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 584 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:12,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 46 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:59:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 05:59:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 105. [2022-04-15 05:59:13,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:13,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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:59:13,468 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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:59:13,468 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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:59:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:13,471 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2022-04-15 05:59:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2022-04-15 05:59:13,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:13,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:13,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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 267 states. [2022-04-15 05:59:13,472 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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 267 states. [2022-04-15 05:59:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:13,476 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2022-04-15 05:59:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2022-04-15 05:59:13,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:13,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:13,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 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:59:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-04-15 05:59:13,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2022-04-15 05:59:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:13,479 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-04-15 05:59:13,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call 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:13,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 106 transitions. [2022-04-15 05:59:13,693 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:59:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 05:59:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 05:59:13,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:13,694 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:13,711 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:13,894 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:13,895 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2100890045, now seen corresponding path program 85 times [2022-04-15 05:59:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123964481] [2022-04-15 05:59:13,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:59:13,899 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:13,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2100890045, now seen corresponding path program 86 times [2022-04-15 05:59:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:13,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778065955] [2022-04-15 05:59:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:14,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {50326#(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(10, 2); {50278#true} is VALID [2022-04-15 05:59:14,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 05:59:14,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 05:59:14,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:14,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {50326#(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(10, 2); {50278#true} is VALID [2022-04-15 05:59:14,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 05:59:14,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 05:59:14,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 05:59:14,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50283#(= main_~i~0 0)} is VALID [2022-04-15 05:59:14,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {50283#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50283#(= main_~i~0 0)} is VALID [2022-04-15 05:59:14,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {50283#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:14,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {50284#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:14,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {50284#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:14,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {50285#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:14,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {50285#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:14,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {50286#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:14,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {50286#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:14,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {50287#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:14,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {50287#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:14,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {50288#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:14,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {50288#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:14,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {50289#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:14,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {50289#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:14,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {50290#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:14,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {50290#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:14,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {50291#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:14,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {50291#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:14,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {50292#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:14,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {50292#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:14,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {50293#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:14,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {50293#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:14,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {50294#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:14,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {50294#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:14,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {50295#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:14,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {50295#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:14,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {50296#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:14,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {50296#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:14,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {50297#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:14,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {50297#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:14,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {50298#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:14,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {50298#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:14,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {50299#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:14,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {50299#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:14,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {50300#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:14,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {50300#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:14,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {50301#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:14,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {50301#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:14,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {50302#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:14,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {50302#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:14,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {50303#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:14,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {50303#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:14,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {50304#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:14,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {50304#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:14,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {50305#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:14,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {50305#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:14,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {50306#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:14,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {50306#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:14,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {50307#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:14,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {50307#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:14,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {50308#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:14,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {50308#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:14,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {50309#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:14,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {50309#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:14,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {50310#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:14,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {50310#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:14,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {50311#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:14,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {50311#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:14,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {50312#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:14,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {50312#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:14,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {50313#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:14,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {50313#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:14,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {50314#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:14,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {50314#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:14,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {50315#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:14,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {50315#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:14,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {50316#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:14,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {50316#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:14,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {50317#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:14,730 INFO L290 TraceCheckUtils]: 75: Hoare triple {50317#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:14,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {50318#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:14,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {50318#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:14,731 INFO L290 TraceCheckUtils]: 78: Hoare triple {50319#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:14,731 INFO L290 TraceCheckUtils]: 79: Hoare triple {50319#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:14,731 INFO L290 TraceCheckUtils]: 80: Hoare triple {50320#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:14,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {50320#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:14,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {50321#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:14,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {50321#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:14,733 INFO L290 TraceCheckUtils]: 84: Hoare triple {50322#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:14,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {50322#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:14,733 INFO L290 TraceCheckUtils]: 86: Hoare triple {50323#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:14,734 INFO L290 TraceCheckUtils]: 87: Hoare triple {50323#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:14,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {50324#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:14,734 INFO L290 TraceCheckUtils]: 89: Hoare triple {50324#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {50325#(<= main_~i~0 42)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 05:59:14,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 05:59:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778065955] [2022-04-15 05:59:14,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778065955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727200403] [2022-04-15 05:59:14,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:14,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:14,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:14,743 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:14,744 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:15,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:15,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:15,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 05:59:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:15,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:15,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50278#true} is VALID [2022-04-15 05:59:15,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#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(10, 2); {50278#true} is VALID [2022-04-15 05:59:15,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 05:59:15,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 05:59:15,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 05:59:15,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50345#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:15,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {50345#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50345#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:15,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {50345#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:15,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {50284#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50284#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:15,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {50284#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:15,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {50285#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50285#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:15,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {50285#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:15,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {50286#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50286#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:15,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {50286#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:15,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {50287#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50287#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:15,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {50287#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:15,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {50288#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50288#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:15,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {50288#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:15,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {50289#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50289#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:15,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {50289#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:15,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {50290#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50290#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:15,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {50290#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:15,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {50291#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50291#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:15,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {50291#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:15,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {50292#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50292#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:15,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {50292#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:15,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {50293#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50293#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:15,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {50293#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:15,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {50294#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50294#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:15,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {50294#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:15,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {50295#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50295#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:15,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {50295#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:15,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {50296#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50296#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:15,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {50296#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:15,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {50297#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50297#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:15,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {50297#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:15,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {50298#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50298#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:15,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {50298#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:15,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {50299#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50299#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:15,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {50299#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:15,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {50300#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50300#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:15,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {50300#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:15,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {50301#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50301#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:15,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {50301#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:15,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {50302#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50302#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:15,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {50302#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:15,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {50303#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50303#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:15,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {50303#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:15,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {50304#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50304#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:15,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {50304#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:15,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {50305#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50305#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:15,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {50305#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:15,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {50306#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50306#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:15,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {50306#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:15,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {50307#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50307#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:15,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {50307#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:15,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {50308#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50308#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:15,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {50308#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:15,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {50309#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50309#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:15,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {50309#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:15,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {50310#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50310#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:15,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {50310#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:15,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {50311#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50311#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:15,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {50311#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:15,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {50312#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50312#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:15,670 INFO L290 TraceCheckUtils]: 65: Hoare triple {50312#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:15,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {50313#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50313#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:15,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {50313#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:15,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {50314#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50314#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:15,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {50314#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:15,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {50315#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50315#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:15,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {50315#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:15,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {50316#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50316#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:15,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {50316#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:15,673 INFO L290 TraceCheckUtils]: 74: Hoare triple {50317#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50317#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:15,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {50317#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:15,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {50318#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50318#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:15,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {50318#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:15,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {50319#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50319#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:15,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {50319#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:15,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {50320#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50320#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:15,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {50320#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:15,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {50321#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50321#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:15,676 INFO L290 TraceCheckUtils]: 83: Hoare triple {50321#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:15,677 INFO L290 TraceCheckUtils]: 84: Hoare triple {50322#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50322#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:15,677 INFO L290 TraceCheckUtils]: 85: Hoare triple {50322#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:15,677 INFO L290 TraceCheckUtils]: 86: Hoare triple {50323#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50323#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:15,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {50323#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:15,678 INFO L290 TraceCheckUtils]: 88: Hoare triple {50324#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50324#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 89: Hoare triple {50324#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50325#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {50325#(<= main_~i~0 42)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:15,679 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:15,680 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:15,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:15,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:15,702 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:15,702 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 05:59:15,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 05:59:15,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 05:59:15,703 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 05:59:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:15,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:18,050 INFO L290 TraceCheckUtils]: 103: Hoare triple {50279#false} assume !false; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 102: Hoare triple {50279#false} assume 0 == ~cond; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 101: Hoare triple {50279#false} ~cond := #in~cond; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L272 TraceCheckUtils]: 100: Hoare triple {50279#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 99: Hoare triple {50279#false} assume !(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {50279#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 93: Hoare triple {50279#false} assume !!(0 != #t~mem4);havoc #t~mem4; {50279#false} is VALID [2022-04-15 05:59:18,051 INFO L290 TraceCheckUtils]: 92: Hoare triple {50279#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {50279#false} is VALID [2022-04-15 05:59:18,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {50279#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {50279#false} is VALID [2022-04-15 05:59:18,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {50679#(< main_~i~0 1023)} assume !(~i~0 < 1023); {50279#false} is VALID [2022-04-15 05:59:18,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {50683#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50679#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:18,053 INFO L290 TraceCheckUtils]: 88: Hoare triple {50683#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50683#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:18,053 INFO L290 TraceCheckUtils]: 87: Hoare triple {50690#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50683#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:18,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {50690#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50690#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:18,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {50697#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50690#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:18,054 INFO L290 TraceCheckUtils]: 84: Hoare triple {50697#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50697#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:18,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {50704#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50697#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:18,055 INFO L290 TraceCheckUtils]: 82: Hoare triple {50704#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50704#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:18,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {50711#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50704#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:18,055 INFO L290 TraceCheckUtils]: 80: Hoare triple {50711#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50711#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:18,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {50718#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50711#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:18,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {50718#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50718#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:18,056 INFO L290 TraceCheckUtils]: 77: Hoare triple {50725#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50718#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:18,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {50725#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50725#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:18,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {50732#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50725#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:18,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {50732#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50732#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:18,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {50739#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50732#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:18,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {50739#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50739#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:18,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {50746#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50739#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:18,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {50746#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50746#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:18,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {50753#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50746#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:18,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {50753#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50753#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:18,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {50760#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50753#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:18,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {50760#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50760#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:18,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {50767#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50760#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:18,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {50767#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50767#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:18,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {50774#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50767#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:18,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {50774#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50774#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:18,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {50781#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50774#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:18,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {50781#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50781#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:18,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {50788#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50781#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:18,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {50788#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50788#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:18,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {50795#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50788#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:18,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {50795#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50795#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:18,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {50802#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50795#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:18,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {50802#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50802#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:18,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {50809#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50802#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:18,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {50809#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50809#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:18,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {50816#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50809#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:18,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {50816#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50816#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:18,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {50823#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50816#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:18,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {50823#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50823#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:18,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {50830#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50823#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:18,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {50830#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50830#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:18,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {50837#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50830#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:18,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {50837#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -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 1000)} is VALID [2022-04-15 05:59:18,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {50844#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50837#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:18,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {50844#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -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 999)} is VALID [2022-04-15 05:59:18,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {50851#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(< main_~i~0 999)} is VALID [2022-04-15 05:59:18,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {50851#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -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 998)} is VALID [2022-04-15 05:59:18,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {50858#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(< main_~i~0 998)} is VALID [2022-04-15 05:59:18,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {50858#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -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 997)} is VALID [2022-04-15 05:59:18,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {50865#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(< main_~i~0 997)} is VALID [2022-04-15 05:59:18,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {50865#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -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 996)} is VALID [2022-04-15 05:59:18,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {50872#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(< main_~i~0 996)} is VALID [2022-04-15 05:59:18,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {50872#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -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 995)} is VALID [2022-04-15 05:59:18,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {50879#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(< main_~i~0 995)} is VALID [2022-04-15 05:59:18,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {50879#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50879#(< main_~i~0 994)} is VALID [2022-04-15 05:59:18,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {50886#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50879#(< main_~i~0 994)} is VALID [2022-04-15 05:59:18,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {50886#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50886#(< main_~i~0 993)} is VALID [2022-04-15 05:59:18,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {50893#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50886#(< main_~i~0 993)} is VALID [2022-04-15 05:59:18,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {50893#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50893#(< main_~i~0 992)} is VALID [2022-04-15 05:59:18,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {50900#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50893#(< main_~i~0 992)} is VALID [2022-04-15 05:59:18,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {50900#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50900#(< main_~i~0 991)} is VALID [2022-04-15 05:59:18,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {50907#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50900#(< main_~i~0 991)} is VALID [2022-04-15 05:59:18,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {50907#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50907#(< main_~i~0 990)} is VALID [2022-04-15 05:59:18,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {50914#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50907#(< main_~i~0 990)} is VALID [2022-04-15 05:59:18,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {50914#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50914#(< main_~i~0 989)} is VALID [2022-04-15 05:59:18,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {50921#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50914#(< main_~i~0 989)} is VALID [2022-04-15 05:59:18,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {50921#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50921#(< main_~i~0 988)} is VALID [2022-04-15 05:59:18,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {50928#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50921#(< main_~i~0 988)} is VALID [2022-04-15 05:59:18,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {50928#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50928#(< main_~i~0 987)} is VALID [2022-04-15 05:59:18,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {50935#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50928#(< main_~i~0 987)} is VALID [2022-04-15 05:59:18,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {50935#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50935#(< main_~i~0 986)} is VALID [2022-04-15 05:59:18,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {50942#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50935#(< main_~i~0 986)} is VALID [2022-04-15 05:59:18,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {50942#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50942#(< main_~i~0 985)} is VALID [2022-04-15 05:59:18,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {50949#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50942#(< main_~i~0 985)} is VALID [2022-04-15 05:59:18,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {50949#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50949#(< main_~i~0 984)} is VALID [2022-04-15 05:59:18,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {50956#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50949#(< main_~i~0 984)} is VALID [2022-04-15 05:59:18,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {50956#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50956#(< main_~i~0 983)} is VALID [2022-04-15 05:59:18,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {50963#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50956#(< main_~i~0 983)} is VALID [2022-04-15 05:59:18,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {50963#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50963#(< main_~i~0 982)} is VALID [2022-04-15 05:59:18,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {50970#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50963#(< main_~i~0 982)} is VALID [2022-04-15 05:59:18,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {50970#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50970#(< main_~i~0 981)} is VALID [2022-04-15 05:59:18,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {50278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50970#(< main_~i~0 981)} is VALID [2022-04-15 05:59:18,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {50278#true} call #t~ret5 := main(); {50278#true} is VALID [2022-04-15 05:59:18,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50278#true} {50278#true} #58#return; {50278#true} is VALID [2022-04-15 05:59:18,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {50278#true} assume true; {50278#true} is VALID [2022-04-15 05:59:18,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {50278#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(10, 2); {50278#true} is VALID [2022-04-15 05:59:18,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {50278#true} call ULTIMATE.init(); {50278#true} is VALID [2022-04-15 05:59:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727200403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:18,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 05:59:18,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:18,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123964481] [2022-04-15 05:59:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123964481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:18,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 05:59:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226062671] [2022-04-15 05:59:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:18,082 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 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 104 [2022-04-15 05:59:18,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:18,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call 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,145 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:59:18,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 05:59:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:18,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 05:59:18,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 05:59:18,147 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call 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,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:24,382 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-04-15 05:59:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 05:59:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 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 104 [2022-04-15 05:59:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call 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,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 325 transitions. [2022-04-15 05:59:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call 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,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 325 transitions. [2022-04-15 05:59:24,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 325 transitions. [2022-04-15 05:59:24,613 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:59:24,616 INFO L225 Difference]: With dead ends: 287 [2022-04-15 05:59:24,617 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 05:59:24,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 05:59:24,618 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 593 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:24,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 41 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:59:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 05:59:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 107. [2022-04-15 05:59:25,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:25,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:25,147 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:25,147 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:25,150 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2022-04-15 05:59:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-04-15 05:59:25,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:25,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:25,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 05:59:25,151 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 05:59:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:25,154 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2022-04-15 05:59:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-04-15 05:59:25,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:25,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:25,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:25,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 05:59:25,156 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2022-04-15 05:59:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:25,156 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 05:59:25,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call 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:25,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 05:59:25,349 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:59:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 05:59:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 05:59:25,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:25,350 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:25,369 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:25,550 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:25,550 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2083049371, now seen corresponding path program 87 times [2022-04-15 05:59:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840416361] [2022-04-15 05:59:25,555 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:25,555 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:25,555 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2083049371, now seen corresponding path program 88 times [2022-04-15 05:59:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:25,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852816460] [2022-04-15 05:59:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:26,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:26,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {52463#(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(10, 2); {52414#true} is VALID [2022-04-15 05:59:26,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 05:59:26,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 05:59:26,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:26,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {52463#(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(10, 2); {52414#true} is VALID [2022-04-15 05:59:26,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 05:59:26,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 05:59:26,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 05:59:26,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {52419#(= main_~i~0 0)} is VALID [2022-04-15 05:59:26,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {52419#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52419#(= main_~i~0 0)} is VALID [2022-04-15 05:59:26,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {52419#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:26,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {52420#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:26,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {52420#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:26,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {52421#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:26,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {52421#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:26,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {52422#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:26,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {52422#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:26,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {52423#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:26,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {52423#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:26,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {52424#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:26,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {52424#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:26,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {52425#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:26,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {52425#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:26,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {52426#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:26,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {52426#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:26,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {52427#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:26,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {52427#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:26,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {52428#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:26,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:26,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {52429#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:26,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {52429#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:26,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {52430#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:26,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {52430#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:26,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {52431#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:26,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {52431#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:26,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {52432#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:26,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {52432#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:26,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {52433#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:26,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {52433#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:26,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {52434#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:26,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {52434#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:26,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {52435#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:26,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {52435#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:26,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {52436#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:26,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {52436#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:26,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {52437#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:26,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {52437#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:26,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {52438#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:26,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {52438#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:26,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {52439#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:26,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {52439#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:26,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {52440#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:26,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {52440#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:26,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {52441#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:26,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {52441#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:26,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {52442#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:26,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {52442#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:26,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {52443#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:26,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {52443#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:26,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {52444#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:26,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {52444#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:26,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {52445#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:26,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {52445#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:26,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {52446#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:26,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {52446#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:26,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {52447#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:26,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {52447#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:26,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {52448#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:26,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {52448#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:26,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {52449#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:26,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {52449#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:26,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {52450#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:26,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {52450#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:26,414 INFO L290 TraceCheckUtils]: 70: Hoare triple {52451#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:26,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {52451#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:26,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {52452#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:26,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {52452#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:26,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {52453#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:26,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {52453#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:26,416 INFO L290 TraceCheckUtils]: 76: Hoare triple {52454#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:26,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {52454#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:26,417 INFO L290 TraceCheckUtils]: 78: Hoare triple {52455#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:26,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {52455#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:26,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {52456#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:26,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {52456#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:26,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {52457#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:26,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {52457#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:26,420 INFO L290 TraceCheckUtils]: 84: Hoare triple {52458#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:26,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {52458#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:26,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {52459#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:26,421 INFO L290 TraceCheckUtils]: 87: Hoare triple {52459#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:26,421 INFO L290 TraceCheckUtils]: 88: Hoare triple {52460#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:26,422 INFO L290 TraceCheckUtils]: 89: Hoare triple {52460#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:26,422 INFO L290 TraceCheckUtils]: 90: Hoare triple {52461#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:26,422 INFO L290 TraceCheckUtils]: 91: Hoare triple {52461#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52462#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 92: Hoare triple {52462#(<= main_~i~0 43)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:26,423 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 05:59:26,424 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 05:59:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:26,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852816460] [2022-04-15 05:59:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852816460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:26,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171196428] [2022-04-15 05:59:26,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:26,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:26,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:26,428 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:26,429 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:26,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:26,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:26,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 05:59:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:26,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:27,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52414#true} is VALID [2022-04-15 05:59:27,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#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(10, 2); {52414#true} is VALID [2022-04-15 05:59:27,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 05:59:27,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 05:59:27,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 05:59:27,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {52482#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:27,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {52482#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52482#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:27,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {52482#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:27,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {52420#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52420#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:27,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {52420#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:27,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {52421#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52421#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:27,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {52421#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:27,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {52422#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52422#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:27,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {52422#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:27,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {52423#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52423#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:27,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {52423#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:27,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {52424#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52424#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:27,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {52424#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:27,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {52425#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52425#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:27,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {52425#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:27,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {52426#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52426#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:27,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {52426#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:27,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {52427#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52427#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:27,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {52427#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:27,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {52428#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52428#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:27,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:27,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {52429#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52429#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:27,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {52429#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:27,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {52430#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52430#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:27,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {52430#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:27,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {52431#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52431#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:27,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {52431#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:27,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {52432#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52432#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:27,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {52432#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:27,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {52433#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52433#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:27,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {52433#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:27,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {52434#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52434#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:27,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {52434#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:27,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {52435#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52435#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:27,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {52435#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:27,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {52436#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52436#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:27,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {52436#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:27,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {52437#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52437#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:27,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {52437#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:27,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {52438#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52438#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:27,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {52438#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:27,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {52439#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52439#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:27,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {52439#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:27,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {52440#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52440#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:27,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {52440#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:27,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {52441#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52441#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:27,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {52441#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:27,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {52442#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52442#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:27,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {52442#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:27,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {52443#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52443#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:27,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {52443#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:27,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {52444#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52444#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:27,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {52444#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:27,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {52445#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52445#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:27,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {52445#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:27,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {52446#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52446#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:27,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {52446#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:27,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {52447#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52447#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:27,324 INFO L290 TraceCheckUtils]: 63: Hoare triple {52447#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:27,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {52448#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52448#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:27,325 INFO L290 TraceCheckUtils]: 65: Hoare triple {52448#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:27,325 INFO L290 TraceCheckUtils]: 66: Hoare triple {52449#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52449#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:27,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {52449#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:27,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {52450#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52450#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:27,326 INFO L290 TraceCheckUtils]: 69: Hoare triple {52450#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:27,326 INFO L290 TraceCheckUtils]: 70: Hoare triple {52451#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52451#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:27,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {52451#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:27,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {52452#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52452#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:27,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {52452#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:27,327 INFO L290 TraceCheckUtils]: 74: Hoare triple {52453#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52453#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:27,328 INFO L290 TraceCheckUtils]: 75: Hoare triple {52453#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:27,328 INFO L290 TraceCheckUtils]: 76: Hoare triple {52454#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52454#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:27,328 INFO L290 TraceCheckUtils]: 77: Hoare triple {52454#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:27,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {52455#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52455#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:27,329 INFO L290 TraceCheckUtils]: 79: Hoare triple {52455#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:27,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {52456#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52456#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:27,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {52456#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:27,330 INFO L290 TraceCheckUtils]: 82: Hoare triple {52457#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52457#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:27,330 INFO L290 TraceCheckUtils]: 83: Hoare triple {52457#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:27,331 INFO L290 TraceCheckUtils]: 84: Hoare triple {52458#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52458#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:27,331 INFO L290 TraceCheckUtils]: 85: Hoare triple {52458#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:27,331 INFO L290 TraceCheckUtils]: 86: Hoare triple {52459#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52459#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:27,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {52459#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:27,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {52460#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52460#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:27,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {52460#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 90: Hoare triple {52461#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52461#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {52461#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52462#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {52462#(<= main_~i~0 43)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:27,333 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 05:59:27,334 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 05:59:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:27,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 105: Hoare triple {52415#false} assume !false; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 104: Hoare triple {52415#false} assume 0 == ~cond; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 103: Hoare triple {52415#false} ~cond := #in~cond; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L272 TraceCheckUtils]: 102: Hoare triple {52415#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {52415#false} assume !(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 98: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:29,719 INFO L290 TraceCheckUtils]: 97: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 96: Hoare triple {52415#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 95: Hoare triple {52415#false} assume !!(0 != #t~mem4);havoc #t~mem4; {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 94: Hoare triple {52415#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 93: Hoare triple {52415#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 92: Hoare triple {52822#(< main_~i~0 1023)} assume !(~i~0 < 1023); {52415#false} is VALID [2022-04-15 05:59:29,720 INFO L290 TraceCheckUtils]: 91: Hoare triple {52826#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52822#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:29,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {52826#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52826#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:29,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {52833#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52826#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:29,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {52833#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52833#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:29,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {52840#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52833#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:29,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {52840#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52840#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:29,722 INFO L290 TraceCheckUtils]: 85: Hoare triple {52847#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52840#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:29,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {52847#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52847#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:29,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {52854#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52847#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:29,723 INFO L290 TraceCheckUtils]: 82: Hoare triple {52854#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52854#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:29,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {52861#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52854#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:29,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {52861#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52861#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:29,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {52868#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52861#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:29,725 INFO L290 TraceCheckUtils]: 78: Hoare triple {52868#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52868#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:29,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {52875#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52868#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:29,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {52875#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52875#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:29,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {52882#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52875#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:29,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {52882#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52882#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:29,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {52889#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52882#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:29,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {52889#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52889#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:29,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {52896#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52889#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:29,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {52896#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52896#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:29,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {52903#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52896#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:29,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {52903#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52903#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:29,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {52910#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52903#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:29,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {52910#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52910#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:29,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {52917#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52910#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:29,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {52917#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52917#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:29,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {52924#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52917#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:29,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {52924#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52924#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:29,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {52931#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52924#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:29,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {52931#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52931#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:29,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {52938#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52931#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:29,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {52938#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52938#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:29,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {52945#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52938#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:29,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {52945#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52945#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:29,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {52952#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52945#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:29,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {52952#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52952#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:29,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {52959#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52952#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:29,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {52959#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52959#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:29,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {52966#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52959#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:29,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {52966#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52966#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:29,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {52973#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52966#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:29,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {52973#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52973#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:29,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {52980#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52973#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:29,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {52980#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52980#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:29,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {52987#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52980#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:29,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {52987#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52987#(< main_~i~0 999)} is VALID [2022-04-15 05:59:29,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {52994#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52987#(< main_~i~0 999)} is VALID [2022-04-15 05:59:29,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {52994#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {52994#(< main_~i~0 998)} is VALID [2022-04-15 05:59:29,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {53001#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {52994#(< main_~i~0 998)} is VALID [2022-04-15 05:59:29,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {53001#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53001#(< main_~i~0 997)} is VALID [2022-04-15 05:59:29,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {53008#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53001#(< main_~i~0 997)} is VALID [2022-04-15 05:59:29,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {53008#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53008#(< main_~i~0 996)} is VALID [2022-04-15 05:59:29,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {53015#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53008#(< main_~i~0 996)} is VALID [2022-04-15 05:59:29,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {53015#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53015#(< main_~i~0 995)} is VALID [2022-04-15 05:59:29,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {53022#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53015#(< main_~i~0 995)} is VALID [2022-04-15 05:59:29,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {53022#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53022#(< main_~i~0 994)} is VALID [2022-04-15 05:59:29,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {53029#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53022#(< main_~i~0 994)} is VALID [2022-04-15 05:59:29,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {53029#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53029#(< main_~i~0 993)} is VALID [2022-04-15 05:59:29,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {53036#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53029#(< main_~i~0 993)} is VALID [2022-04-15 05:59:29,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {53036#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53036#(< main_~i~0 992)} is VALID [2022-04-15 05:59:29,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {53043#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53036#(< main_~i~0 992)} is VALID [2022-04-15 05:59:29,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {53043#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53043#(< main_~i~0 991)} is VALID [2022-04-15 05:59:29,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {53050#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53043#(< main_~i~0 991)} is VALID [2022-04-15 05:59:29,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {53050#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53050#(< main_~i~0 990)} is VALID [2022-04-15 05:59:29,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {53057#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53050#(< main_~i~0 990)} is VALID [2022-04-15 05:59:29,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {53057#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53057#(< main_~i~0 989)} is VALID [2022-04-15 05:59:29,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {53064#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53057#(< main_~i~0 989)} is VALID [2022-04-15 05:59:29,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {53064#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53064#(< main_~i~0 988)} is VALID [2022-04-15 05:59:29,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {53071#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53064#(< main_~i~0 988)} is VALID [2022-04-15 05:59:29,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {53071#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53071#(< main_~i~0 987)} is VALID [2022-04-15 05:59:29,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53071#(< main_~i~0 987)} is VALID [2022-04-15 05:59:29,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -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#(< main_~i~0 986)} is VALID [2022-04-15 05:59:29,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {53085#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#(< main_~i~0 986)} is VALID [2022-04-15 05:59:29,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {53085#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -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 985)} is VALID [2022-04-15 05:59:29,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {53092#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53085#(< main_~i~0 985)} is VALID [2022-04-15 05:59:29,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {53092#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -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 984)} is VALID [2022-04-15 05:59:29,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {53099#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53092#(< main_~i~0 984)} is VALID [2022-04-15 05:59:29,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {53099#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -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 983)} is VALID [2022-04-15 05:59:29,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {53106#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53099#(< main_~i~0 983)} is VALID [2022-04-15 05:59:29,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {53106#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -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 982)} is VALID [2022-04-15 05:59:29,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {53113#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53106#(< main_~i~0 982)} is VALID [2022-04-15 05:59:29,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {53113#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -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 981)} is VALID [2022-04-15 05:59:29,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {53120#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53113#(< main_~i~0 981)} is VALID [2022-04-15 05:59:29,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {53120#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -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 980)} is VALID [2022-04-15 05:59:29,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {52414#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53120#(< main_~i~0 980)} is VALID [2022-04-15 05:59:29,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {52414#true} call #t~ret5 := main(); {52414#true} is VALID [2022-04-15 05:59:29,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52414#true} {52414#true} #58#return; {52414#true} is VALID [2022-04-15 05:59:29,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {52414#true} assume true; {52414#true} is VALID [2022-04-15 05:59:29,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {52414#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(10, 2); {52414#true} is VALID [2022-04-15 05:59:29,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {52414#true} call ULTIMATE.init(); {52414#true} is VALID [2022-04-15 05:59:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:29,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171196428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:29,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:29,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 05:59:29,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:29,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840416361] [2022-04-15 05:59:29,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840416361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:29,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:29,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 05:59:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346412886] [2022-04-15 05:59:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:29,751 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 05:59:29,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:29,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call 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:29,823 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:59:29,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 05:59:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 05:59:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 05:59:29,827 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call 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:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:36,577 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2022-04-15 05:59:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 05:59:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 05:59:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call 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:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 332 transitions. [2022-04-15 05:59:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call 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:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 332 transitions. [2022-04-15 05:59:36,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 332 transitions. [2022-04-15 05:59:36,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:36,850 INFO L225 Difference]: With dead ends: 293 [2022-04-15 05:59:36,850 INFO L226 Difference]: Without dead ends: 279 [2022-04-15 05:59:36,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 169 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:36,851 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 558 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:36,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 51 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:59:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-04-15 05:59:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 109. [2022-04-15 05:59:37,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:37,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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:37,431 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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:37,431 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:37,434 INFO L93 Difference]: Finished difference Result 279 states and 322 transitions. [2022-04-15 05:59:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-04-15 05:59:37,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:37,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:37,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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 279 states. [2022-04-15 05:59:37,435 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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 279 states. [2022-04-15 05:59:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:37,438 INFO L93 Difference]: Finished difference Result 279 states and 322 transitions. [2022-04-15 05:59:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-04-15 05:59:37,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:37,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:37,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:37,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 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:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-15 05:59:37,440 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2022-04-15 05:59:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:37,440 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-15 05:59:37,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call 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,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-15 05:59:37,642 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:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 05:59:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 05:59:37,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:37,643 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:37,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:37,843 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:37,844 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2118030841, now seen corresponding path program 89 times [2022-04-15 05:59:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:37,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679321019] [2022-04-15 05:59:37,849 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:37,849 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:37,849 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2118030841, now seen corresponding path program 90 times [2022-04-15 05:59:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:37,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043826410] [2022-04-15 05:59:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:38,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {54644#(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(10, 2); {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:38,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {54644#(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(10, 2); {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 05:59:38,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 05:59:38,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54599#(= main_~i~0 0)} is VALID [2022-04-15 05:59:38,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {54599#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54599#(= main_~i~0 0)} is VALID [2022-04-15 05:59:38,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {54599#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:38,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {54600#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:38,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {54600#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:38,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {54601#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:38,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {54601#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54602#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:38,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {54602#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54602#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:38,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {54602#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54603#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:38,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {54603#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54603#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:38,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {54603#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54604#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:38,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {54604#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54604#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:38,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {54604#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54605#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:38,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {54605#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54605#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:38,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {54605#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54606#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:38,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {54606#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54606#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:38,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {54606#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54607#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:38,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {54607#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54607#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:38,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {54607#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54608#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:38,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {54608#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54608#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:38,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {54608#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54609#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:38,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {54609#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54609#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:38,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {54609#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54610#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:38,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {54610#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54610#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:38,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {54610#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54611#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:38,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {54611#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54611#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:38,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {54611#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54612#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:38,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {54612#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54612#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:38,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {54612#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54613#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:38,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {54613#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54613#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:38,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {54613#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54614#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:38,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {54614#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54614#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:38,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {54614#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54615#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:38,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {54615#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54615#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:38,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {54615#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54616#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:38,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {54616#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54616#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:38,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {54616#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54617#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:38,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {54617#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54617#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:38,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {54617#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54618#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:38,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {54618#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54618#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:38,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {54618#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54619#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:38,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {54619#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54619#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:38,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {54619#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54620#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:38,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {54620#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54620#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:38,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {54620#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54621#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:38,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {54621#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54621#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:38,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {54621#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54622#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:38,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {54622#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54622#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:38,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {54622#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54623#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:38,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {54623#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54623#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:38,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {54623#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54624#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:38,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {54624#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54624#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:38,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {54624#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54625#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:38,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {54625#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54625#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:38,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {54625#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54626#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:38,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {54626#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54626#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:38,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {54626#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54627#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:38,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {54627#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54627#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:38,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {54627#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54628#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:38,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {54628#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54628#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:38,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {54628#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54629#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:38,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {54629#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54629#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:38,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {54629#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54630#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:38,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {54630#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54630#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:38,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {54630#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54631#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:38,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {54631#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54631#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:38,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {54631#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54632#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:38,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {54632#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54632#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:38,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {54632#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54633#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:38,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {54633#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54633#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:38,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {54633#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54634#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:38,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {54634#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54634#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:38,814 INFO L290 TraceCheckUtils]: 77: Hoare triple {54634#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54635#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:38,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {54635#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54635#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:38,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {54635#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54636#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:38,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {54636#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54636#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:38,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {54636#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54637#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:38,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {54637#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54637#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:38,816 INFO L290 TraceCheckUtils]: 83: Hoare triple {54637#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54638#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:38,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {54638#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54638#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:38,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {54638#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54639#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:38,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {54639#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54639#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:38,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {54639#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54640#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:38,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {54640#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54640#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:38,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {54640#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54641#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:38,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {54641#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54641#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:38,819 INFO L290 TraceCheckUtils]: 91: Hoare triple {54641#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54642#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:38,819 INFO L290 TraceCheckUtils]: 92: Hoare triple {54642#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54642#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {54642#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54643#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 94: Hoare triple {54643#(<= main_~i~0 44)} assume !(~i~0 < 1023); {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 95: Hoare triple {54595#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 96: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 97: Hoare triple {54595#false} assume !!(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 98: Hoare triple {54595#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 99: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 05:59:38,820 INFO L290 TraceCheckUtils]: 100: Hoare triple {54595#false} assume !!(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 101: Hoare triple {54595#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 102: Hoare triple {54595#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 103: Hoare triple {54595#false} assume !(0 != #t~mem4);havoc #t~mem4; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L272 TraceCheckUtils]: 104: Hoare triple {54595#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 105: Hoare triple {54595#false} ~cond := #in~cond; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 106: Hoare triple {54595#false} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 05:59:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043826410] [2022-04-15 05:59:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043826410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892841277] [2022-04-15 05:59:38,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:38,823 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:38,824 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:39,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:59:39,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:39,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:59:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:39,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:39,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#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(10, 2); {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 71: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 74: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 75: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 79: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 80: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 81: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,352 INFO L290 TraceCheckUtils]: 87: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 88: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 89: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 90: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 91: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 94: Hoare triple {54594#true} assume !(~i~0 < 1023); {54594#true} is VALID [2022-04-15 05:59:39,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {54594#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {54933#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:39,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {54933#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54933#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:39,354 INFO L290 TraceCheckUtils]: 97: Hoare triple {54933#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {54933#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:39,354 INFO L290 TraceCheckUtils]: 98: Hoare triple {54933#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:39,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {54600#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54600#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:39,355 INFO L290 TraceCheckUtils]: 100: Hoare triple {54600#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {54600#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:39,355 INFO L290 TraceCheckUtils]: 101: Hoare triple {54600#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:39,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {54601#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54601#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:39,356 INFO L290 TraceCheckUtils]: 103: Hoare triple {54601#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {54601#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:39,356 INFO L272 TraceCheckUtils]: 104: Hoare triple {54601#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:39,357 INFO L290 TraceCheckUtils]: 105: Hoare triple {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:39,357 INFO L290 TraceCheckUtils]: 106: Hoare triple {54965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 05:59:39,357 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 05:59:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 05:59:39,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:39,654 INFO L290 TraceCheckUtils]: 107: Hoare triple {54595#false} assume !false; {54595#false} is VALID [2022-04-15 05:59:39,655 INFO L290 TraceCheckUtils]: 106: Hoare triple {54965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54595#false} is VALID [2022-04-15 05:59:39,655 INFO L290 TraceCheckUtils]: 105: Hoare triple {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:39,656 INFO L272 TraceCheckUtils]: 104: Hoare triple {54981#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {54961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:39,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {54981#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:39,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {54981#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:39,657 INFO L290 TraceCheckUtils]: 101: Hoare triple {54991#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54981#(<= main_~i~0 1024)} is VALID [2022-04-15 05:59:39,657 INFO L290 TraceCheckUtils]: 100: Hoare triple {54991#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:39,657 INFO L290 TraceCheckUtils]: 99: Hoare triple {54991#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:39,658 INFO L290 TraceCheckUtils]: 98: Hoare triple {55001#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {54991#(<= main_~i~0 1023)} is VALID [2022-04-15 05:59:39,658 INFO L290 TraceCheckUtils]: 97: Hoare triple {55001#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:39,658 INFO L290 TraceCheckUtils]: 96: Hoare triple {55001#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:39,658 INFO L290 TraceCheckUtils]: 95: Hoare triple {54594#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {55001#(<= main_~i~0 1022)} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 94: Hoare triple {54594#true} assume !(~i~0 < 1023); {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 93: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 89: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 88: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 87: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 86: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 69: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,660 INFO L290 TraceCheckUtils]: 66: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {54594#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {54594#true} is VALID [2022-04-15 05:59:39,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {54594#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {54594#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {54594#true} call #t~ret5 := main(); {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54594#true} {54594#true} #58#return; {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {54594#true} assume true; {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {54594#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(10, 2); {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {54594#true} call ULTIMATE.init(); {54594#true} is VALID [2022-04-15 05:59:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 05:59:39,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892841277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:39,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:39,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 7, 7] total 54 [2022-04-15 05:59:39,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:39,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679321019] [2022-04-15 05:59:39,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679321019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:39,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:39,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 05:59:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126646152] [2022-04-15 05:59:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:39,666 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 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 108 [2022-04-15 05:59:39,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:39,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call 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:39,733 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:59:39,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 05:59:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 05:59:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=1581, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:59:39,735 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call 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,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,496 INFO L93 Difference]: Finished difference Result 299 states and 344 transitions. [2022-04-15 05:59:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 05:59:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 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 108 [2022-04-15 05:59:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call 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,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 339 transitions. [2022-04-15 05:59:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call 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,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 339 transitions. [2022-04-15 05:59:46,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 339 transitions. [2022-04-15 05:59:46,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 339 edges. 339 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:46,749 INFO L225 Difference]: With dead ends: 299 [2022-04-15 05:59:46,749 INFO L226 Difference]: Without dead ends: 285 [2022-04-15 05:59:46,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3577, Invalid=6125, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 05:59:46,750 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 685 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:46,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 36 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-04-15 05:59:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 111. [2022-04-15 05:59:47,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:47,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:47,330 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:47,330 INFO L87 Difference]: Start difference. First operand 285 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:47,334 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2022-04-15 05:59:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2022-04-15 05:59:47,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:47,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:47,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-15 05:59:47,334 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 285 states. [2022-04-15 05:59:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:47,338 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2022-04-15 05:59:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2022-04-15 05:59:47,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:47,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:47,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:47,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-15 05:59:47,339 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2022-04-15 05:59:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:47,340 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-15 05:59:47,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call 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:47,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-15 05:59:47,554 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:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-15 05:59:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 05:59:47,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:47,555 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:47,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-15 05:59:47,755 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:47,756 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1375485143, now seen corresponding path program 91 times [2022-04-15 05:59:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:47,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916450003] [2022-04-15 05:59:47,763 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,763 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:47,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1375485143, now seen corresponding path program 92 times [2022-04-15 05:59:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:47,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136027378] [2022-04-15 05:59:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {56829#(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(10, 2); {56778#true} is VALID [2022-04-15 05:59:48,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 05:59:48,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 05:59:48,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:48,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {56829#(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(10, 2); {56778#true} is VALID [2022-04-15 05:59:48,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 05:59:48,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 05:59:48,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 05:59:48,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56783#(= main_~i~0 0)} is VALID [2022-04-15 05:59:48,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {56783#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56783#(= main_~i~0 0)} is VALID [2022-04-15 05:59:48,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {56783#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {56784#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {56784#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {56785#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {56785#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:48,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {56786#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:48,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {56786#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:48,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {56787#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:48,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {56787#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:48,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {56788#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:48,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {56788#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:48,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {56789#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:48,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {56789#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:48,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {56790#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:48,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {56790#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:48,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {56791#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:48,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {56791#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:48,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {56792#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:48,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {56792#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:48,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {56793#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:48,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {56793#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:48,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {56794#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:48,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {56794#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:48,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {56795#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:48,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {56795#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:48,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {56796#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:48,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {56796#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:48,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {56797#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:48,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {56797#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:48,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {56798#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:48,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {56798#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:48,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {56799#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:48,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {56799#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:48,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {56800#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:48,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {56800#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:48,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {56801#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:48,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {56801#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:48,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {56802#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:48,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {56802#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:48,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {56803#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:48,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {56803#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:48,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {56804#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:48,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {56804#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:48,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {56805#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:48,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {56805#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:48,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {56806#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:48,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {56806#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:48,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {56807#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:48,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {56807#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:48,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {56808#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:48,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {56808#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:48,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {56809#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:48,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {56809#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:48,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {56810#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:48,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {56810#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:48,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {56811#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:48,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {56811#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:48,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {56812#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:48,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {56812#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:48,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {56813#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:48,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {56813#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:48,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {56814#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:48,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {56814#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:48,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {56815#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:48,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {56815#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:48,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {56816#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:48,652 INFO L290 TraceCheckUtils]: 73: Hoare triple {56816#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:48,652 INFO L290 TraceCheckUtils]: 74: Hoare triple {56817#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:48,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {56817#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:48,653 INFO L290 TraceCheckUtils]: 76: Hoare triple {56818#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:48,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {56818#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:48,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {56819#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:48,654 INFO L290 TraceCheckUtils]: 79: Hoare triple {56819#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:48,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {56820#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:48,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {56820#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:48,655 INFO L290 TraceCheckUtils]: 82: Hoare triple {56821#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:48,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {56821#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:48,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {56822#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:48,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {56822#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:48,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {56823#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:48,656 INFO L290 TraceCheckUtils]: 87: Hoare triple {56823#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:48,657 INFO L290 TraceCheckUtils]: 88: Hoare triple {56824#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:48,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {56824#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:48,657 INFO L290 TraceCheckUtils]: 90: Hoare triple {56825#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:48,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {56825#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:48,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {56826#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:48,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {56826#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:48,659 INFO L290 TraceCheckUtils]: 94: Hoare triple {56827#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:48,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {56827#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56828#(<= main_~i~0 45)} is VALID [2022-04-15 05:59:48,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {56828#(<= main_~i~0 45)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 05:59:48,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 05:59:48,660 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 05:59:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136027378] [2022-04-15 05:59:48,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136027378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:48,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245320752] [2022-04-15 05:59:48,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:48,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:48,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:48,663 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 05:59:48,668 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 05:59:48,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:48,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:48,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 05:59:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:49,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56778#true} is VALID [2022-04-15 05:59:49,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#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(10, 2); {56778#true} is VALID [2022-04-15 05:59:49,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 05:59:49,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 05:59:49,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 05:59:49,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56848#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:49,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {56848#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56848#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:49,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {56848#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:49,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {56784#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56784#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:49,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {56784#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:49,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {56785#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56785#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:49,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {56785#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:49,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {56786#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56786#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:49,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {56786#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:49,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {56787#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56787#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:49,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {56787#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:49,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {56788#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56788#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:49,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {56788#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:49,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {56789#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56789#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:49,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {56789#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:49,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {56790#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56790#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:49,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {56790#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:49,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {56791#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56791#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:49,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {56791#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:49,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {56792#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56792#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:49,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {56792#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:49,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {56793#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56793#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:49,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {56793#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:49,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {56794#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56794#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:49,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {56794#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:49,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {56795#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56795#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:49,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {56795#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:49,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {56796#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56796#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:49,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {56796#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:49,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {56797#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56797#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:49,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {56797#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:49,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {56798#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56798#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:49,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {56798#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:49,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {56799#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56799#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:49,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {56799#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:49,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {56800#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56800#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:49,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {56800#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:49,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {56801#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56801#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:49,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {56801#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:49,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {56802#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56802#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:49,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {56802#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:49,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {56803#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56803#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:49,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {56803#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:49,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {56804#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56804#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:49,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {56804#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:49,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {56805#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56805#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:49,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {56805#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:49,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {56806#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56806#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:49,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {56806#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:49,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {56807#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56807#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:49,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {56807#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:49,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {56808#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56808#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:49,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {56808#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:49,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {56809#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56809#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:49,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {56809#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:49,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {56810#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56810#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:49,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {56810#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:49,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {56811#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56811#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:49,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {56811#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:49,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {56812#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56812#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:49,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {56812#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:49,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {56813#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56813#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:49,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {56813#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:49,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {56814#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56814#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:49,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {56814#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:49,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {56815#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56815#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:49,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {56815#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:49,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {56816#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56816#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:49,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {56816#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:49,567 INFO L290 TraceCheckUtils]: 74: Hoare triple {56817#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56817#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:49,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {56817#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:49,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {56818#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56818#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:49,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {56818#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:49,568 INFO L290 TraceCheckUtils]: 78: Hoare triple {56819#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56819#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:49,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {56819#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:49,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {56820#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56820#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:49,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {56820#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:49,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {56821#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56821#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:49,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {56821#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:49,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {56822#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56822#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:49,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {56822#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:49,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {56823#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56823#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:49,571 INFO L290 TraceCheckUtils]: 87: Hoare triple {56823#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:49,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {56824#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56824#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:49,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {56824#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:49,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {56825#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56825#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:49,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {56825#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:49,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {56826#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56826#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:49,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {56826#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {56827#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56827#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {56827#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56828#(<= main_~i~0 45)} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {56828#(<= main_~i~0 45)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:49,574 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 05:59:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:49,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:52,132 INFO L290 TraceCheckUtils]: 109: Hoare triple {56779#false} assume !false; {56779#false} is VALID [2022-04-15 05:59:52,132 INFO L290 TraceCheckUtils]: 108: Hoare triple {56779#false} assume 0 == ~cond; {56779#false} is VALID [2022-04-15 05:59:52,132 INFO L290 TraceCheckUtils]: 107: Hoare triple {56779#false} ~cond := #in~cond; {56779#false} is VALID [2022-04-15 05:59:52,132 INFO L272 TraceCheckUtils]: 106: Hoare triple {56779#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 105: Hoare triple {56779#false} assume !(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 104: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 103: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 100: Hoare triple {56779#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 99: Hoare triple {56779#false} assume !!(0 != #t~mem4);havoc #t~mem4; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {56779#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {56779#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {56779#false} is VALID [2022-04-15 05:59:52,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {57200#(< main_~i~0 1023)} assume !(~i~0 < 1023); {56779#false} is VALID [2022-04-15 05:59:52,134 INFO L290 TraceCheckUtils]: 95: Hoare triple {57204#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57200#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:52,134 INFO L290 TraceCheckUtils]: 94: Hoare triple {57204#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57204#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:52,134 INFO L290 TraceCheckUtils]: 93: Hoare triple {57211#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57204#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:52,135 INFO L290 TraceCheckUtils]: 92: Hoare triple {57211#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57211#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:52,135 INFO L290 TraceCheckUtils]: 91: Hoare triple {57218#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57211#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:52,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {57218#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57218#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:52,136 INFO L290 TraceCheckUtils]: 89: Hoare triple {57225#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57218#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:52,136 INFO L290 TraceCheckUtils]: 88: Hoare triple {57225#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57225#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:52,136 INFO L290 TraceCheckUtils]: 87: Hoare triple {57232#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57225#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:52,137 INFO L290 TraceCheckUtils]: 86: Hoare triple {57232#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57232#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:52,137 INFO L290 TraceCheckUtils]: 85: Hoare triple {57239#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57232#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:52,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {57239#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57239#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:52,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {57246#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57239#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:52,138 INFO L290 TraceCheckUtils]: 82: Hoare triple {57246#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57246#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:52,138 INFO L290 TraceCheckUtils]: 81: Hoare triple {57253#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57246#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:52,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {57253#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57253#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:52,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {57260#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57253#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:52,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {57260#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57260#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:52,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {57267#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57260#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:52,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {57267#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57267#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:52,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {57274#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57267#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:52,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {57274#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57274#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:52,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {57281#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57274#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:52,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {57281#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57281#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:52,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {57288#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57281#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:52,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {57288#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57288#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:52,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {57295#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57288#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:52,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {57295#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57295#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:52,143 INFO L290 TraceCheckUtils]: 67: Hoare triple {57302#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57295#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:52,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {57302#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57302#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:52,144 INFO L290 TraceCheckUtils]: 65: Hoare triple {57309#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57302#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:52,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {57309#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57309#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:52,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {57316#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57309#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:52,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {57316#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57316#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:52,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {57323#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57316#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:52,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {57323#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57323#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:52,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {57330#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57323#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:52,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {57330#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57330#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:52,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {57337#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57330#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:52,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {57337#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57337#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:52,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {57344#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57337#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:52,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {57344#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57344#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:52,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {57351#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57344#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:52,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {57351#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57351#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:52,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {57358#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57351#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:52,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {57358#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57358#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:52,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {57365#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57358#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:52,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {57365#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57365#(< main_~i~0 999)} is VALID [2022-04-15 05:59:52,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {57372#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57365#(< main_~i~0 999)} is VALID [2022-04-15 05:59:52,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {57372#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57372#(< main_~i~0 998)} is VALID [2022-04-15 05:59:52,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {57379#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57372#(< main_~i~0 998)} is VALID [2022-04-15 05:59:52,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {57379#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57379#(< main_~i~0 997)} is VALID [2022-04-15 05:59:52,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {57386#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57379#(< main_~i~0 997)} is VALID [2022-04-15 05:59:52,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {57386#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57386#(< main_~i~0 996)} is VALID [2022-04-15 05:59:52,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {57393#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57386#(< main_~i~0 996)} is VALID [2022-04-15 05:59:52,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {57393#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57393#(< main_~i~0 995)} is VALID [2022-04-15 05:59:52,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {57400#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57393#(< main_~i~0 995)} is VALID [2022-04-15 05:59:52,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {57400#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57400#(< main_~i~0 994)} is VALID [2022-04-15 05:59:52,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {57407#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57400#(< main_~i~0 994)} is VALID [2022-04-15 05:59:52,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {57407#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57407#(< main_~i~0 993)} is VALID [2022-04-15 05:59:52,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {57414#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57407#(< main_~i~0 993)} is VALID [2022-04-15 05:59:52,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {57414#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57414#(< main_~i~0 992)} is VALID [2022-04-15 05:59:52,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {57421#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57414#(< main_~i~0 992)} is VALID [2022-04-15 05:59:52,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {57421#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57421#(< main_~i~0 991)} is VALID [2022-04-15 05:59:52,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {57428#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57421#(< main_~i~0 991)} is VALID [2022-04-15 05:59:52,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {57428#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57428#(< main_~i~0 990)} is VALID [2022-04-15 05:59:52,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {57435#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57428#(< main_~i~0 990)} is VALID [2022-04-15 05:59:52,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {57435#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57435#(< main_~i~0 989)} is VALID [2022-04-15 05:59:52,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {57442#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57435#(< main_~i~0 989)} is VALID [2022-04-15 05:59:52,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {57442#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57442#(< main_~i~0 988)} is VALID [2022-04-15 05:59:52,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {57449#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57442#(< main_~i~0 988)} is VALID [2022-04-15 05:59:52,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {57449#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57449#(< main_~i~0 987)} is VALID [2022-04-15 05:59:52,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {57456#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57449#(< main_~i~0 987)} is VALID [2022-04-15 05:59:52,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {57456#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57456#(< main_~i~0 986)} is VALID [2022-04-15 05:59:52,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {57463#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57456#(< main_~i~0 986)} is VALID [2022-04-15 05:59:52,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {57463#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57463#(< main_~i~0 985)} is VALID [2022-04-15 05:59:52,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {57470#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57463#(< main_~i~0 985)} is VALID [2022-04-15 05:59:52,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {57470#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57470#(< main_~i~0 984)} is VALID [2022-04-15 05:59:52,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {57477#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57470#(< main_~i~0 984)} is VALID [2022-04-15 05:59:52,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {57477#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57477#(< main_~i~0 983)} is VALID [2022-04-15 05:59:52,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {57484#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57477#(< main_~i~0 983)} is VALID [2022-04-15 05:59:52,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {57484#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57484#(< main_~i~0 982)} is VALID [2022-04-15 05:59:52,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {57491#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57484#(< main_~i~0 982)} is VALID [2022-04-15 05:59:52,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {57491#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57491#(< main_~i~0 981)} is VALID [2022-04-15 05:59:52,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {57498#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57491#(< main_~i~0 981)} is VALID [2022-04-15 05:59:52,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {57498#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57498#(< main_~i~0 980)} is VALID [2022-04-15 05:59:52,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {57505#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57498#(< main_~i~0 980)} is VALID [2022-04-15 05:59:52,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {57505#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57505#(< main_~i~0 979)} is VALID [2022-04-15 05:59:52,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {57512#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57505#(< main_~i~0 979)} is VALID [2022-04-15 05:59:52,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {57512#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57512#(< main_~i~0 978)} is VALID [2022-04-15 05:59:52,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {56778#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57512#(< main_~i~0 978)} is VALID [2022-04-15 05:59:52,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {56778#true} call #t~ret5 := main(); {56778#true} is VALID [2022-04-15 05:59:52,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56778#true} {56778#true} #58#return; {56778#true} is VALID [2022-04-15 05:59:52,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {56778#true} assume true; {56778#true} is VALID [2022-04-15 05:59:52,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {56778#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(10, 2); {56778#true} is VALID [2022-04-15 05:59:52,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {56778#true} call ULTIMATE.init(); {56778#true} is VALID [2022-04-15 05:59:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 05:59:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245320752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:52,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:52,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 05:59:52,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:52,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916450003] [2022-04-15 05:59:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916450003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:52,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:52,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 05:59:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371869460] [2022-04-15 05:59:52,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 05:59:52,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:52,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call 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:52,232 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:59:52,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 05:59:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 05:59:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 05:59:52,234 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call 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:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:59,263 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2022-04-15 05:59:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 05:59:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 05:59:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call 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:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 346 transitions. [2022-04-15 05:59:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call 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:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 346 transitions. [2022-04-15 05:59:59,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 346 transitions. [2022-04-15 05:59:59,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:59,516 INFO L225 Difference]: With dead ends: 305 [2022-04-15 05:59:59,516 INFO L226 Difference]: Without dead ends: 291 [2022-04-15 05:59:59,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 05:59:59,517 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 628 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:59,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 41 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:59:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-15 06:00:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 113. [2022-04-15 06:00:00,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:00,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 06:00:00,119 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 06:00:00,119 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 06:00:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:00,124 INFO L93 Difference]: Finished difference Result 291 states and 336 transitions. [2022-04-15 06:00:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2022-04-15 06:00:00,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:00,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:00,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 291 states. [2022-04-15 06:00:00,125 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 291 states. [2022-04-15 06:00:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:00,130 INFO L93 Difference]: Finished difference Result 291 states and 336 transitions. [2022-04-15 06:00:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2022-04-15 06:00:00,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:00,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:00,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:00,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 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 06:00:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2022-04-15 06:00:00,132 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2022-04-15 06:00:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:00,132 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2022-04-15 06:00:00,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 48 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have 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:00,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 114 transitions. [2022-04-15 06:00:00,373 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 06:00:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 06:00:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 06:00:00,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:00,373 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:00,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:00,574 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:00,574 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -753640501, now seen corresponding path program 93 times [2022-04-15 06:00:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:00,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710216303] [2022-04-15 06:00:00,579 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:00,579 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:00,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash -753640501, now seen corresponding path program 94 times [2022-04-15 06:00:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:00,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335968953] [2022-04-15 06:00:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:01,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {59098#(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(10, 2); {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59098#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:01,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {59098#(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(10, 2); {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 06:00:01,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 06:00:01,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59051#(= main_~i~0 0)} is VALID [2022-04-15 06:00:01,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {59051#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59051#(= main_~i~0 0)} is VALID [2022-04-15 06:00:01,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {59051#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:01,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {59052#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:01,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {59052#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:01,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {59053#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:01,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {59053#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:01,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {59054#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:01,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {59054#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:01,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {59055#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:01,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {59055#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:01,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {59056#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:01,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {59056#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:01,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {59057#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:01,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {59057#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:01,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {59058#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:01,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {59058#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:01,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {59059#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:01,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {59059#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:01,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {59060#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:01,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {59060#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:01,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {59061#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:01,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {59061#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:01,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {59062#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:01,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {59062#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:01,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {59063#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:01,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {59063#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:01,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {59064#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:01,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {59064#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:01,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {59065#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:01,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {59065#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:01,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {59066#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:01,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {59066#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:01,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {59067#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:01,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {59067#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:01,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {59068#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:01,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {59068#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:01,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {59069#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:01,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {59069#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:01,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {59070#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:01,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {59070#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:01,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {59071#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:01,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {59071#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:01,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {59072#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:01,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {59072#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:01,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {59073#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:01,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {59073#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:01,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {59074#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:01,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {59074#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:01,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {59075#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:01,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {59075#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:01,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {59076#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:01,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {59076#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:01,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {59077#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:01,577 INFO L290 TraceCheckUtils]: 59: Hoare triple {59077#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:01,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {59078#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:01,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {59078#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:01,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {59079#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:01,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {59079#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:01,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {59080#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:01,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {59080#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:01,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {59081#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:01,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {59081#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:01,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {59082#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:01,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {59082#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:01,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {59083#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:01,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {59083#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:01,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {59084#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:01,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {59084#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:01,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {59085#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:01,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {59085#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:01,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {59086#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:01,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {59086#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:01,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {59087#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:01,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {59087#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:01,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {59088#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:01,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {59088#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:01,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {59089#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:01,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {59089#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:01,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {59090#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:01,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {59090#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:01,588 INFO L290 TraceCheckUtils]: 86: Hoare triple {59091#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:01,588 INFO L290 TraceCheckUtils]: 87: Hoare triple {59091#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:01,589 INFO L290 TraceCheckUtils]: 88: Hoare triple {59092#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:01,589 INFO L290 TraceCheckUtils]: 89: Hoare triple {59092#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:01,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {59093#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:01,590 INFO L290 TraceCheckUtils]: 91: Hoare triple {59093#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:01,590 INFO L290 TraceCheckUtils]: 92: Hoare triple {59094#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:01,590 INFO L290 TraceCheckUtils]: 93: Hoare triple {59094#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:01,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {59095#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:01,591 INFO L290 TraceCheckUtils]: 95: Hoare triple {59095#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:01,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {59096#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:01,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {59096#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 98: Hoare triple {59097#(<= main_~i~0 46)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:01,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:01,593 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 06:00:01,593 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 06:00:01,593 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 06:00:01,593 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 06:00:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335968953] [2022-04-15 06:00:01,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335968953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658382251] [2022-04-15 06:00:01,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:01,594 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:01,595 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:01,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:01,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:01,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 06:00:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:01,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:02,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59046#true} is VALID [2022-04-15 06:00:02,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#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(10, 2); {59046#true} is VALID [2022-04-15 06:00:02,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 06:00:02,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 06:00:02,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 06:00:02,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59117#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:02,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {59117#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59117#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:02,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {59117#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:02,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {59052#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59052#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:02,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {59052#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:02,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {59053#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59053#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:02,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {59053#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:02,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {59054#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59054#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:02,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {59054#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:02,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {59055#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59055#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:02,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {59055#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:02,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {59056#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59056#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:02,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {59056#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:02,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {59057#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59057#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:02,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {59057#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:02,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {59058#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59058#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:02,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {59058#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:02,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {59059#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59059#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:02,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {59059#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:02,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {59060#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59060#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:02,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {59060#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:02,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {59061#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59061#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:02,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {59061#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:02,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {59062#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59062#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:02,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {59062#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:02,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {59063#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59063#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:02,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {59063#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:02,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {59064#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59064#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:02,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {59064#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:02,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {59065#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59065#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:02,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {59065#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:02,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {59066#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59066#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:02,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {59066#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:02,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {59067#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59067#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:02,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {59067#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:02,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {59068#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59068#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:02,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {59068#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:02,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {59069#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59069#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:02,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {59069#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:02,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {59070#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59070#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:02,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {59070#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:02,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {59071#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59071#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:02,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {59071#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:02,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {59072#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59072#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:02,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {59072#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:02,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {59073#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59073#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:02,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {59073#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:02,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {59074#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59074#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:02,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {59074#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:02,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {59075#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59075#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:02,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {59075#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:02,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {59076#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59076#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:02,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {59076#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:02,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {59077#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59077#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:02,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {59077#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:02,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {59078#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59078#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:02,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {59078#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:02,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {59079#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59079#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:02,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {59079#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:02,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {59080#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59080#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:02,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {59080#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:02,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {59081#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59081#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:02,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {59081#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:02,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {59082#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59082#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:02,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {59082#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:02,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {59083#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59083#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:02,511 INFO L290 TraceCheckUtils]: 71: Hoare triple {59083#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:02,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {59084#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59084#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:02,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {59084#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:02,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {59085#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59085#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:02,513 INFO L290 TraceCheckUtils]: 75: Hoare triple {59085#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:02,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {59086#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59086#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:02,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {59086#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:02,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {59087#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59087#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:02,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {59087#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:02,514 INFO L290 TraceCheckUtils]: 80: Hoare triple {59088#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59088#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:02,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {59088#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:02,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {59089#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59089#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:02,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {59089#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:02,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {59090#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59090#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:02,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {59090#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:02,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {59091#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59091#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:02,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {59091#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:02,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {59092#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59092#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:02,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {59092#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:02,517 INFO L290 TraceCheckUtils]: 90: Hoare triple {59093#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59093#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:02,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {59093#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:02,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {59094#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59094#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:02,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {59094#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:02,519 INFO L290 TraceCheckUtils]: 94: Hoare triple {59095#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59095#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:02,519 INFO L290 TraceCheckUtils]: 95: Hoare triple {59095#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:02,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {59096#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59096#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 97: Hoare triple {59096#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59097#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 98: Hoare triple {59097#(<= main_~i~0 46)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:02,520 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 06:00:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:02,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:05,207 INFO L290 TraceCheckUtils]: 111: Hoare triple {59047#false} assume !false; {59047#false} is VALID [2022-04-15 06:00:05,207 INFO L290 TraceCheckUtils]: 110: Hoare triple {59047#false} assume 0 == ~cond; {59047#false} is VALID [2022-04-15 06:00:05,207 INFO L290 TraceCheckUtils]: 109: Hoare triple {59047#false} ~cond := #in~cond; {59047#false} is VALID [2022-04-15 06:00:05,207 INFO L272 TraceCheckUtils]: 108: Hoare triple {59047#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {59047#false} is VALID [2022-04-15 06:00:05,207 INFO L290 TraceCheckUtils]: 107: Hoare triple {59047#false} assume !(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:05,207 INFO L290 TraceCheckUtils]: 106: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 105: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 104: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 103: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 102: Hoare triple {59047#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 101: Hoare triple {59047#false} assume !!(0 != #t~mem4);havoc #t~mem4; {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 100: Hoare triple {59047#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 99: Hoare triple {59047#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {59047#false} is VALID [2022-04-15 06:00:05,208 INFO L290 TraceCheckUtils]: 98: Hoare triple {59475#(< main_~i~0 1023)} assume !(~i~0 < 1023); {59047#false} is VALID [2022-04-15 06:00:05,209 INFO L290 TraceCheckUtils]: 97: Hoare triple {59479#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59475#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:05,209 INFO L290 TraceCheckUtils]: 96: Hoare triple {59479#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59479#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:05,209 INFO L290 TraceCheckUtils]: 95: Hoare triple {59486#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59479#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:05,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {59486#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59486#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:05,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {59493#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59486#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:05,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {59493#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59493#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:05,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {59500#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59493#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:05,211 INFO L290 TraceCheckUtils]: 90: Hoare triple {59500#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59500#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:05,211 INFO L290 TraceCheckUtils]: 89: Hoare triple {59507#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59500#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:05,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {59507#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59507#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:05,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {59514#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59507#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:05,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {59514#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59514#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:05,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {59521#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59514#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:05,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {59521#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59521#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:05,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {59528#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59521#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:05,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {59528#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59528#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:05,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {59535#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59528#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:05,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {59535#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59535#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:05,215 INFO L290 TraceCheckUtils]: 79: Hoare triple {59542#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59535#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:05,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {59542#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59542#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:05,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {59549#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59542#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:05,216 INFO L290 TraceCheckUtils]: 76: Hoare triple {59549#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59549#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:05,216 INFO L290 TraceCheckUtils]: 75: Hoare triple {59556#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59549#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:05,216 INFO L290 TraceCheckUtils]: 74: Hoare triple {59556#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59556#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:05,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {59563#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59556#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:05,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {59563#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59563#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:05,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {59570#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59563#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:05,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {59570#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59570#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:05,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {59577#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59570#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:05,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {59577#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59577#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:05,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {59584#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59577#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:05,219 INFO L290 TraceCheckUtils]: 66: Hoare triple {59584#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59584#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:05,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {59591#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59584#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:05,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {59591#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59591#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:05,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {59598#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59591#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:05,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {59598#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59598#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:05,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {59605#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59598#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:05,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {59605#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59605#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:05,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {59612#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59605#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:05,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {59612#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59612#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:05,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {59619#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59612#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:05,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {59619#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59619#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:05,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {59626#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59619#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:05,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {59626#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59626#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:05,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {59633#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59626#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:05,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {59633#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59633#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:05,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {59640#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59633#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:05,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {59640#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59640#(< main_~i~0 999)} is VALID [2022-04-15 06:00:05,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {59647#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59640#(< main_~i~0 999)} is VALID [2022-04-15 06:00:05,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {59647#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59647#(< main_~i~0 998)} is VALID [2022-04-15 06:00:05,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {59654#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59647#(< main_~i~0 998)} is VALID [2022-04-15 06:00:05,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {59654#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59654#(< main_~i~0 997)} is VALID [2022-04-15 06:00:05,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {59661#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59654#(< main_~i~0 997)} is VALID [2022-04-15 06:00:05,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {59661#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59661#(< main_~i~0 996)} is VALID [2022-04-15 06:00:05,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {59668#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59661#(< main_~i~0 996)} is VALID [2022-04-15 06:00:05,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {59668#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59668#(< main_~i~0 995)} is VALID [2022-04-15 06:00:05,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {59675#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59668#(< main_~i~0 995)} is VALID [2022-04-15 06:00:05,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {59675#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59675#(< main_~i~0 994)} is VALID [2022-04-15 06:00:05,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {59682#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59675#(< main_~i~0 994)} is VALID [2022-04-15 06:00:05,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {59682#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59682#(< main_~i~0 993)} is VALID [2022-04-15 06:00:05,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {59689#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59682#(< main_~i~0 993)} is VALID [2022-04-15 06:00:05,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {59689#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59689#(< main_~i~0 992)} is VALID [2022-04-15 06:00:05,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {59696#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59689#(< main_~i~0 992)} is VALID [2022-04-15 06:00:05,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {59696#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59696#(< main_~i~0 991)} is VALID [2022-04-15 06:00:05,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {59703#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59696#(< main_~i~0 991)} is VALID [2022-04-15 06:00:05,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {59703#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59703#(< main_~i~0 990)} is VALID [2022-04-15 06:00:05,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {59710#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59703#(< main_~i~0 990)} is VALID [2022-04-15 06:00:05,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {59710#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59710#(< main_~i~0 989)} is VALID [2022-04-15 06:00:05,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {59717#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59710#(< main_~i~0 989)} is VALID [2022-04-15 06:00:05,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {59717#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59717#(< main_~i~0 988)} is VALID [2022-04-15 06:00:05,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {59724#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59717#(< main_~i~0 988)} is VALID [2022-04-15 06:00:05,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {59724#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59724#(< main_~i~0 987)} is VALID [2022-04-15 06:00:05,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {59731#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59724#(< main_~i~0 987)} is VALID [2022-04-15 06:00:05,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {59731#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59731#(< main_~i~0 986)} is VALID [2022-04-15 06:00:05,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {59738#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59731#(< main_~i~0 986)} is VALID [2022-04-15 06:00:05,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {59738#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59738#(< main_~i~0 985)} is VALID [2022-04-15 06:00:05,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {59745#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59738#(< main_~i~0 985)} is VALID [2022-04-15 06:00:05,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {59745#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59745#(< main_~i~0 984)} is VALID [2022-04-15 06:00:05,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {59752#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59745#(< main_~i~0 984)} is VALID [2022-04-15 06:00:05,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {59752#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59752#(< main_~i~0 983)} is VALID [2022-04-15 06:00:05,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {59759#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59752#(< main_~i~0 983)} is VALID [2022-04-15 06:00:05,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {59759#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59759#(< main_~i~0 982)} is VALID [2022-04-15 06:00:05,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {59766#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59759#(< main_~i~0 982)} is VALID [2022-04-15 06:00:05,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {59766#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59766#(< main_~i~0 981)} is VALID [2022-04-15 06:00:05,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {59773#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59766#(< main_~i~0 981)} is VALID [2022-04-15 06:00:05,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {59773#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59773#(< main_~i~0 980)} is VALID [2022-04-15 06:00:05,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {59780#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59773#(< main_~i~0 980)} is VALID [2022-04-15 06:00:05,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {59780#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59780#(< main_~i~0 979)} is VALID [2022-04-15 06:00:05,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {59787#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59780#(< main_~i~0 979)} is VALID [2022-04-15 06:00:05,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {59787#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59787#(< main_~i~0 978)} is VALID [2022-04-15 06:00:05,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {59794#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {59787#(< main_~i~0 978)} is VALID [2022-04-15 06:00:05,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {59794#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {59794#(< main_~i~0 977)} is VALID [2022-04-15 06:00:05,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {59046#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {59794#(< main_~i~0 977)} is VALID [2022-04-15 06:00:05,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {59046#true} call #t~ret5 := main(); {59046#true} is VALID [2022-04-15 06:00:05,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59046#true} {59046#true} #58#return; {59046#true} is VALID [2022-04-15 06:00:05,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {59046#true} assume true; {59046#true} is VALID [2022-04-15 06:00:05,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {59046#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(10, 2); {59046#true} is VALID [2022-04-15 06:00:05,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {59046#true} call ULTIMATE.init(); {59046#true} is VALID [2022-04-15 06:00:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:05,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658382251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:05,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:05,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 06:00:05,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:05,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710216303] [2022-04-15 06:00:05,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710216303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:05,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:05,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:00:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683246495] [2022-04-15 06:00:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 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 112 [2022-04-15 06:00:05,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:05,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:05,311 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 06:00:05,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:00:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:05,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:00:05,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:00:05,313 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have 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,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:14,048 INFO L93 Difference]: Finished difference Result 311 states and 358 transitions. [2022-04-15 06:00:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:00:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 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 112 [2022-04-15 06:00:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have 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,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 353 transitions. [2022-04-15 06:00:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have 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,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 353 transitions. [2022-04-15 06:00:14,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 353 transitions. [2022-04-15 06:00:14,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:14,330 INFO L225 Difference]: With dead ends: 311 [2022-04-15 06:00:14,330 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 06:00:14,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:00:14,331 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 647 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:14,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 46 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 06:00:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 115. [2022-04-15 06:00:14,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:14,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:14,974 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:14,975 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:14,980 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2022-04-15 06:00:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2022-04-15 06:00:14,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:14,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:14,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-15 06:00:14,981 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-15 06:00:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:14,986 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2022-04-15 06:00:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2022-04-15 06:00:14,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:14,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:14,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:14,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-15 06:00:14,989 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2022-04-15 06:00:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:14,989 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-15 06:00:14,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have 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,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-15 06:00:15,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-15 06:00:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 06:00:15,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:15,256 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:15,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-04-15 06:00:15,457 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:15,457 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -161393683, now seen corresponding path program 95 times [2022-04-15 06:00:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:15,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698206988] [2022-04-15 06:00:15,461 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:15,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:15,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -161393683, now seen corresponding path program 96 times [2022-04-15 06:00:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890310552] [2022-04-15 06:00:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {61411#(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(10, 2); {61358#true} is VALID [2022-04-15 06:00:16,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 06:00:16,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 06:00:16,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:16,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {61411#(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(10, 2); {61358#true} is VALID [2022-04-15 06:00:16,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 06:00:16,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 06:00:16,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 06:00:16,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61363#(= main_~i~0 0)} is VALID [2022-04-15 06:00:16,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {61363#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61363#(= main_~i~0 0)} is VALID [2022-04-15 06:00:16,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {61363#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:16,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {61364#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:16,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {61364#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:16,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {61365#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:16,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {61365#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61366#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:16,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {61366#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61366#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:16,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {61366#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61367#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:16,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {61367#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61367#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:16,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {61367#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61368#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:16,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {61368#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61368#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:16,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {61368#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61369#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:16,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {61369#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61369#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:16,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {61369#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61370#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:16,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {61370#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61370#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:16,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {61370#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61371#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:16,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {61371#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61371#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:16,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {61371#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61372#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:16,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {61372#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61372#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:16,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {61372#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61373#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:16,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {61373#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61373#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:16,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {61373#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61374#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:16,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {61374#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61374#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:16,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {61374#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61375#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:16,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {61375#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61375#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:16,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {61375#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61376#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:16,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {61376#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61376#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:16,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {61376#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61377#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:16,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {61377#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61377#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:16,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {61377#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61378#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:16,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {61378#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61378#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:16,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {61378#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61379#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:16,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {61379#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61379#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:16,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {61379#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61380#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:16,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {61380#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61380#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:16,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {61380#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61381#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:16,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {61381#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61381#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:16,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {61381#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61382#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:16,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {61382#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61382#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:16,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {61382#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61383#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:16,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {61383#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61383#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:16,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {61383#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61384#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:16,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {61384#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61384#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:16,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {61384#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61385#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:16,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {61385#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61385#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:16,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {61385#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61386#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:16,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {61386#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61386#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:16,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {61386#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61387#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:16,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {61387#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61387#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:16,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {61387#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61388#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:16,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {61388#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61388#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:16,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {61388#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61389#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:16,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {61389#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61389#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:16,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {61389#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61390#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:16,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {61390#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61390#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:16,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {61390#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61391#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:16,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {61391#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61391#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:16,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {61391#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61392#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:16,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {61392#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61392#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:16,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {61392#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61393#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:16,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {61393#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61393#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:16,588 INFO L290 TraceCheckUtils]: 67: Hoare triple {61393#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61394#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:16,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {61394#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61394#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:16,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {61394#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61395#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:16,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {61395#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61395#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:16,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {61395#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61396#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:16,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {61396#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61396#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:16,591 INFO L290 TraceCheckUtils]: 73: Hoare triple {61396#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61397#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:16,591 INFO L290 TraceCheckUtils]: 74: Hoare triple {61397#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61397#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:16,591 INFO L290 TraceCheckUtils]: 75: Hoare triple {61397#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61398#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:16,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {61398#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61398#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:16,592 INFO L290 TraceCheckUtils]: 77: Hoare triple {61398#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61399#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:16,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {61399#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61399#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:16,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {61399#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61400#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:16,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {61400#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61400#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:16,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {61400#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61401#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:16,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {61401#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61401#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:16,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {61401#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61402#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:16,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {61402#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61402#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:16,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {61402#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61403#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:16,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {61403#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61403#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:16,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {61403#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61404#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:16,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {61404#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61404#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:16,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {61404#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61405#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:16,597 INFO L290 TraceCheckUtils]: 90: Hoare triple {61405#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61405#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:16,598 INFO L290 TraceCheckUtils]: 91: Hoare triple {61405#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61406#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:16,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {61406#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61406#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:16,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {61406#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61407#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:16,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {61407#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61407#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:16,599 INFO L290 TraceCheckUtils]: 95: Hoare triple {61407#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61408#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:16,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {61408#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61408#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:16,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {61408#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61409#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:16,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {61409#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61409#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:16,601 INFO L290 TraceCheckUtils]: 99: Hoare triple {61409#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61410#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {61410#(<= main_~i~0 47)} assume !(~i~0 < 1023); {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {61359#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 102: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 103: Hoare triple {61359#false} assume !!(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 104: Hoare triple {61359#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {61359#false} assume !!(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {61359#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {61359#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {61359#false} assume !(0 != #t~mem4);havoc #t~mem4; {61359#false} is VALID [2022-04-15 06:00:16,602 INFO L272 TraceCheckUtils]: 110: Hoare triple {61359#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61359#false} is VALID [2022-04-15 06:00:16,603 INFO L290 TraceCheckUtils]: 111: Hoare triple {61359#false} ~cond := #in~cond; {61359#false} is VALID [2022-04-15 06:00:16,603 INFO L290 TraceCheckUtils]: 112: Hoare triple {61359#false} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 06:00:16,603 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 06:00:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:16,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890310552] [2022-04-15 06:00:16,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890310552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44476189] [2022-04-15 06:00:16,604 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:16,605 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:16,607 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:16,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:00:16,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:16,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:00:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:17,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61358#true} is VALID [2022-04-15 06:00:17,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#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(10, 2); {61358#true} is VALID [2022-04-15 06:00:17,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 06:00:17,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 06:00:17,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 77: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,202 INFO L290 TraceCheckUtils]: 90: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 91: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 92: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 94: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {61358#true} assume !(~i~0 < 1023); {61358#true} is VALID [2022-04-15 06:00:17,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {61358#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61718#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:17,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {61718#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61718#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:17,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {61718#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {61718#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:17,205 INFO L290 TraceCheckUtils]: 104: Hoare triple {61718#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:17,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {61364#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61364#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:17,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {61364#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {61364#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:17,206 INFO L290 TraceCheckUtils]: 107: Hoare triple {61364#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:17,206 INFO L290 TraceCheckUtils]: 108: Hoare triple {61365#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61365#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:17,206 INFO L290 TraceCheckUtils]: 109: Hoare triple {61365#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {61365#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:17,207 INFO L272 TraceCheckUtils]: 110: Hoare triple {61365#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:00:17,207 INFO L290 TraceCheckUtils]: 111: Hoare triple {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:00:17,207 INFO L290 TraceCheckUtils]: 112: Hoare triple {61750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 06:00:17,207 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 06:00:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 06:00:17,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:17,525 INFO L290 TraceCheckUtils]: 113: Hoare triple {61359#false} assume !false; {61359#false} is VALID [2022-04-15 06:00:17,526 INFO L290 TraceCheckUtils]: 112: Hoare triple {61750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61359#false} is VALID [2022-04-15 06:00:17,526 INFO L290 TraceCheckUtils]: 111: Hoare triple {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:00:17,526 INFO L272 TraceCheckUtils]: 110: Hoare triple {61766#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {61746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:00:17,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {61766#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 06:00:17,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {61766#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 06:00:17,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {61776#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61766#(<= main_~i~0 1024)} is VALID [2022-04-15 06:00:17,528 INFO L290 TraceCheckUtils]: 106: Hoare triple {61776#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 06:00:17,528 INFO L290 TraceCheckUtils]: 105: Hoare triple {61776#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 06:00:17,528 INFO L290 TraceCheckUtils]: 104: Hoare triple {61786#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {61776#(<= main_~i~0 1023)} is VALID [2022-04-15 06:00:17,529 INFO L290 TraceCheckUtils]: 103: Hoare triple {61786#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 06:00:17,529 INFO L290 TraceCheckUtils]: 102: Hoare triple {61786#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 06:00:17,529 INFO L290 TraceCheckUtils]: 101: Hoare triple {61358#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {61786#(<= main_~i~0 1022)} is VALID [2022-04-15 06:00:17,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {61358#true} assume !(~i~0 < 1023); {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 99: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 98: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 97: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 96: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 95: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 94: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 84: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 83: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 82: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 81: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {61358#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {61358#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {61358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {61358#true} call #t~ret5 := main(); {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61358#true} {61358#true} #58#return; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {61358#true} assume true; {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {61358#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(10, 2); {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {61358#true} call ULTIMATE.init(); {61358#true} is VALID [2022-04-15 06:00:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 06:00:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44476189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:17,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 7, 7] total 57 [2022-04-15 06:00:17,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:17,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698206988] [2022-04-15 06:00:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698206988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:17,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:00:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833254350] [2022-04-15 06:00:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 06:00:17,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:17,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:17,630 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 06:00:17,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:00:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:00:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=1755, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:00:17,632 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have 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:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:27,159 INFO L93 Difference]: Finished difference Result 317 states and 365 transitions. [2022-04-15 06:00:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:00:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 06:00:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have 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:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 360 transitions. [2022-04-15 06:00:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have 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:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 360 transitions. [2022-04-15 06:00:27,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 360 transitions. [2022-04-15 06:00:27,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:27,430 INFO L225 Difference]: With dead ends: 317 [2022-04-15 06:00:27,430 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 06:00:27,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4030, Invalid=6890, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:00:27,432 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 681 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:27,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 36 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:00:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 06:00:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 117. [2022-04-15 06:00:28,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:28,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 06:00:28,304 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 06:00:28,304 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 06:00:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:28,309 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2022-04-15 06:00:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2022-04-15 06:00:28,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:28,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:28,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 303 states. [2022-04-15 06:00:28,310 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 303 states. [2022-04-15 06:00:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:28,315 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2022-04-15 06:00:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2022-04-15 06:00:28,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:28,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:28,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:28,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 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 06:00:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-15 06:00:28,318 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2022-04-15 06:00:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:28,318 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-15 06:00:28,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0784313725490198) internal successors, (106), 50 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have 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:28,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-15 06:00:28,604 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 06:00:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 06:00:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 06:00:28,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:28,605 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:28,633 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:28,830 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:28,830 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2052115343, now seen corresponding path program 97 times [2022-04-15 06:00:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:28,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [72835059] [2022-04-15 06:00:28,835 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:28,835 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:28,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2052115343, now seen corresponding path program 98 times [2022-04-15 06:00:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:28,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221297842] [2022-04-15 06:00:28,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:29,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {63725#(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(10, 2); {63671#true} is VALID [2022-04-15 06:00:29,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 06:00:29,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 06:00:29,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:29,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {63725#(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(10, 2); {63671#true} is VALID [2022-04-15 06:00:29,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 06:00:29,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 06:00:29,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 06:00:29,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63676#(= main_~i~0 0)} is VALID [2022-04-15 06:00:29,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {63676#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63676#(= main_~i~0 0)} is VALID [2022-04-15 06:00:29,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {63676#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:29,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {63677#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:29,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {63677#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:29,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {63678#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:29,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {63678#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:29,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {63679#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:29,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {63679#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:29,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {63680#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:29,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {63680#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:29,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {63681#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:29,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {63681#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:29,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {63682#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:29,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {63682#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:29,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {63683#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:29,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {63683#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:29,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {63684#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:29,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {63684#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:29,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {63685#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:29,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {63685#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:29,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {63686#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:29,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {63686#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:29,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {63687#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:29,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {63687#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:29,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {63688#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:29,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {63688#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:29,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {63689#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:29,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {63689#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:29,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {63690#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:29,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {63690#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:29,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {63691#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:29,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {63691#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:29,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {63692#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:29,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {63692#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:29,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {63693#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:29,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {63693#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:29,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {63694#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:29,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {63694#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:29,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {63695#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:29,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {63695#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:29,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {63696#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:29,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {63696#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:29,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {63697#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:29,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {63697#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:29,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {63698#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:29,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {63698#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:29,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {63699#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:29,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {63699#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:29,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {63700#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:29,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {63700#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:29,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {63701#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:29,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {63701#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:29,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {63702#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:29,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {63702#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:29,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {63703#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:29,999 INFO L290 TraceCheckUtils]: 61: Hoare triple {63703#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:29,999 INFO L290 TraceCheckUtils]: 62: Hoare triple {63704#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:30,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {63704#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:30,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {63705#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:30,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {63705#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:30,001 INFO L290 TraceCheckUtils]: 66: Hoare triple {63706#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:30,001 INFO L290 TraceCheckUtils]: 67: Hoare triple {63706#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:30,001 INFO L290 TraceCheckUtils]: 68: Hoare triple {63707#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:30,002 INFO L290 TraceCheckUtils]: 69: Hoare triple {63707#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:30,002 INFO L290 TraceCheckUtils]: 70: Hoare triple {63708#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:30,003 INFO L290 TraceCheckUtils]: 71: Hoare triple {63708#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:30,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {63709#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:30,003 INFO L290 TraceCheckUtils]: 73: Hoare triple {63709#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:30,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {63710#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:30,004 INFO L290 TraceCheckUtils]: 75: Hoare triple {63710#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:30,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {63711#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:30,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {63711#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:30,005 INFO L290 TraceCheckUtils]: 78: Hoare triple {63712#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:30,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {63712#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:30,006 INFO L290 TraceCheckUtils]: 80: Hoare triple {63713#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:30,007 INFO L290 TraceCheckUtils]: 81: Hoare triple {63713#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:30,007 INFO L290 TraceCheckUtils]: 82: Hoare triple {63714#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:30,007 INFO L290 TraceCheckUtils]: 83: Hoare triple {63714#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:30,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {63715#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:30,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {63715#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:30,009 INFO L290 TraceCheckUtils]: 86: Hoare triple {63716#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:30,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {63716#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:30,009 INFO L290 TraceCheckUtils]: 88: Hoare triple {63717#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:30,010 INFO L290 TraceCheckUtils]: 89: Hoare triple {63717#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:30,010 INFO L290 TraceCheckUtils]: 90: Hoare triple {63718#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:30,011 INFO L290 TraceCheckUtils]: 91: Hoare triple {63718#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:30,011 INFO L290 TraceCheckUtils]: 92: Hoare triple {63719#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:30,012 INFO L290 TraceCheckUtils]: 93: Hoare triple {63719#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:30,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {63720#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:30,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {63720#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:30,013 INFO L290 TraceCheckUtils]: 96: Hoare triple {63721#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:30,013 INFO L290 TraceCheckUtils]: 97: Hoare triple {63721#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:30,014 INFO L290 TraceCheckUtils]: 98: Hoare triple {63722#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:30,014 INFO L290 TraceCheckUtils]: 99: Hoare triple {63722#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:30,015 INFO L290 TraceCheckUtils]: 100: Hoare triple {63723#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:30,015 INFO L290 TraceCheckUtils]: 101: Hoare triple {63723#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63724#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {63724#(<= main_~i~0 48)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:30,016 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 06:00:30,017 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 06:00:30,017 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 06:00:30,017 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 06:00:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:30,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221297842] [2022-04-15 06:00:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221297842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433151450] [2022-04-15 06:00:30,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:30,024 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:30,028 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:30,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:30,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:30,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 06:00:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:30,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:31,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63671#true} is VALID [2022-04-15 06:00:31,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#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(10, 2); {63671#true} is VALID [2022-04-15 06:00:31,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 06:00:31,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 06:00:31,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 06:00:31,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63744#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:31,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {63744#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63744#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:31,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {63744#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:31,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {63677#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63677#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:31,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {63677#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:31,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {63678#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63678#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:31,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {63678#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:31,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {63679#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63679#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:31,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {63679#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:31,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {63680#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63680#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:31,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {63680#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:31,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {63681#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63681#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:31,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {63681#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:31,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {63682#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63682#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:31,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {63682#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:31,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {63683#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63683#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:31,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {63683#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:31,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {63684#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63684#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:31,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {63684#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:31,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {63685#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63685#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:31,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {63685#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:31,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {63686#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63686#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:31,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {63686#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:31,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {63687#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63687#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:31,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {63687#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:31,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {63688#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63688#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:31,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {63688#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:31,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {63689#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63689#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:31,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {63689#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:31,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {63690#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63690#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:31,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {63690#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:31,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {63691#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63691#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:31,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {63691#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:31,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {63692#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63692#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:31,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {63692#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:31,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {63693#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63693#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:31,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {63693#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:31,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {63694#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63694#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:31,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {63694#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:31,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {63695#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63695#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:31,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {63695#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:31,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {63696#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63696#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:31,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {63696#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:31,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {63697#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63697#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:31,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {63697#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:31,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {63698#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63698#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:31,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {63698#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:31,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {63699#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63699#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:31,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {63699#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:31,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {63700#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63700#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:31,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {63700#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:31,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {63701#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63701#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:31,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {63701#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:31,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {63702#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63702#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:31,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {63702#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:31,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {63703#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63703#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:31,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {63703#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:31,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {63704#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63704#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:31,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {63704#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:31,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {63705#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63705#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:31,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {63705#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:31,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {63706#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63706#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:31,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {63706#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:31,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {63707#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63707#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:31,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {63707#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:31,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {63708#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63708#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:31,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {63708#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:31,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {63709#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63709#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:31,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {63709#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:31,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {63710#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63710#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:31,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {63710#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:31,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {63711#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63711#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:31,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {63711#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:31,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {63712#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63712#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:31,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {63712#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:31,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {63713#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63713#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:31,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {63713#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:31,226 INFO L290 TraceCheckUtils]: 82: Hoare triple {63714#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63714#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:31,226 INFO L290 TraceCheckUtils]: 83: Hoare triple {63714#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:31,226 INFO L290 TraceCheckUtils]: 84: Hoare triple {63715#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63715#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:31,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {63715#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:31,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {63716#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63716#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:31,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {63716#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:31,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {63717#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63717#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:31,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {63717#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:31,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {63718#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63718#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:31,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {63718#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:31,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {63719#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63719#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:31,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {63719#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:31,230 INFO L290 TraceCheckUtils]: 94: Hoare triple {63720#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63720#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:31,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {63720#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:31,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {63721#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63721#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:31,231 INFO L290 TraceCheckUtils]: 97: Hoare triple {63721#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:31,231 INFO L290 TraceCheckUtils]: 98: Hoare triple {63722#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63722#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:31,231 INFO L290 TraceCheckUtils]: 99: Hoare triple {63722#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:31,231 INFO L290 TraceCheckUtils]: 100: Hoare triple {63723#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63723#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:31,232 INFO L290 TraceCheckUtils]: 101: Hoare triple {63723#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63724#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:31,232 INFO L290 TraceCheckUtils]: 102: Hoare triple {63724#(<= main_~i~0 48)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 06:00:31,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 06:00:31,232 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:31,232 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 06:00:31,233 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 06:00:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:31,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:34,128 INFO L290 TraceCheckUtils]: 115: Hoare triple {63672#false} assume !false; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 114: Hoare triple {63672#false} assume 0 == ~cond; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 113: Hoare triple {63672#false} ~cond := #in~cond; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L272 TraceCheckUtils]: 112: Hoare triple {63672#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 111: Hoare triple {63672#false} assume !(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 110: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 107: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {63672#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 105: Hoare triple {63672#false} assume !!(0 != #t~mem4);havoc #t~mem4; {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 104: Hoare triple {63672#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {63672#false} is VALID [2022-04-15 06:00:34,129 INFO L290 TraceCheckUtils]: 103: Hoare triple {63672#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {63672#false} is VALID [2022-04-15 06:00:34,130 INFO L290 TraceCheckUtils]: 102: Hoare triple {64114#(< main_~i~0 1023)} assume !(~i~0 < 1023); {63672#false} is VALID [2022-04-15 06:00:34,130 INFO L290 TraceCheckUtils]: 101: Hoare triple {64118#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64114#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:34,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {64118#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64118#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:34,131 INFO L290 TraceCheckUtils]: 99: Hoare triple {64125#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64118#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:34,131 INFO L290 TraceCheckUtils]: 98: Hoare triple {64125#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64125#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:34,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {64132#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64125#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:34,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {64132#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64132#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:34,132 INFO L290 TraceCheckUtils]: 95: Hoare triple {64139#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64132#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:34,132 INFO L290 TraceCheckUtils]: 94: Hoare triple {64139#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64139#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:34,133 INFO L290 TraceCheckUtils]: 93: Hoare triple {64146#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64139#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:34,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {64146#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64146#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:34,133 INFO L290 TraceCheckUtils]: 91: Hoare triple {64153#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64146#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:34,134 INFO L290 TraceCheckUtils]: 90: Hoare triple {64153#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64153#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:34,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {64160#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64153#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:34,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {64160#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64160#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:34,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {64167#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64160#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:34,135 INFO L290 TraceCheckUtils]: 86: Hoare triple {64167#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64167#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:34,136 INFO L290 TraceCheckUtils]: 85: Hoare triple {64174#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64167#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:34,136 INFO L290 TraceCheckUtils]: 84: Hoare triple {64174#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64174#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:34,136 INFO L290 TraceCheckUtils]: 83: Hoare triple {64181#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64174#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:34,137 INFO L290 TraceCheckUtils]: 82: Hoare triple {64181#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64181#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:34,137 INFO L290 TraceCheckUtils]: 81: Hoare triple {64188#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64181#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:34,137 INFO L290 TraceCheckUtils]: 80: Hoare triple {64188#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64188#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:34,138 INFO L290 TraceCheckUtils]: 79: Hoare triple {64195#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64188#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:34,138 INFO L290 TraceCheckUtils]: 78: Hoare triple {64195#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64195#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:34,138 INFO L290 TraceCheckUtils]: 77: Hoare triple {64202#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64195#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:34,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {64202#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64202#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:34,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {64209#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64202#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:34,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {64209#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64209#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:34,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {64216#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64209#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:34,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {64216#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64216#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:34,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {64223#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64216#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:34,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {64223#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64223#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:34,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {64230#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64223#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:34,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {64230#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64230#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:34,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {64237#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64230#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:34,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {64237#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64237#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:34,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {64244#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64237#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:34,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {64244#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64244#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:34,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {64251#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64244#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:34,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {64251#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64251#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:34,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {64258#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64251#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:34,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {64258#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64258#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:34,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {64265#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64258#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:34,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {64265#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64265#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:34,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {64272#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64265#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:34,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {64272#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64272#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:34,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {64279#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64272#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:34,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {64279#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64279#(< main_~i~0 999)} is VALID [2022-04-15 06:00:34,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {64286#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64279#(< main_~i~0 999)} is VALID [2022-04-15 06:00:34,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {64286#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64286#(< main_~i~0 998)} is VALID [2022-04-15 06:00:34,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {64293#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64286#(< main_~i~0 998)} is VALID [2022-04-15 06:00:34,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {64293#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64293#(< main_~i~0 997)} is VALID [2022-04-15 06:00:34,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {64300#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64293#(< main_~i~0 997)} is VALID [2022-04-15 06:00:34,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {64300#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64300#(< main_~i~0 996)} is VALID [2022-04-15 06:00:34,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {64307#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64300#(< main_~i~0 996)} is VALID [2022-04-15 06:00:34,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {64307#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64307#(< main_~i~0 995)} is VALID [2022-04-15 06:00:34,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {64314#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64307#(< main_~i~0 995)} is VALID [2022-04-15 06:00:34,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {64314#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64314#(< main_~i~0 994)} is VALID [2022-04-15 06:00:34,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {64321#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64314#(< main_~i~0 994)} is VALID [2022-04-15 06:00:34,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {64321#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64321#(< main_~i~0 993)} is VALID [2022-04-15 06:00:34,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {64328#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64321#(< main_~i~0 993)} is VALID [2022-04-15 06:00:34,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {64328#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64328#(< main_~i~0 992)} is VALID [2022-04-15 06:00:34,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {64335#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64328#(< main_~i~0 992)} is VALID [2022-04-15 06:00:34,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {64335#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64335#(< main_~i~0 991)} is VALID [2022-04-15 06:00:34,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {64342#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64335#(< main_~i~0 991)} is VALID [2022-04-15 06:00:34,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {64342#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64342#(< main_~i~0 990)} is VALID [2022-04-15 06:00:34,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {64349#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64342#(< main_~i~0 990)} is VALID [2022-04-15 06:00:34,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {64349#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64349#(< main_~i~0 989)} is VALID [2022-04-15 06:00:34,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {64356#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64349#(< main_~i~0 989)} is VALID [2022-04-15 06:00:34,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {64356#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64356#(< main_~i~0 988)} is VALID [2022-04-15 06:00:34,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {64363#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64356#(< main_~i~0 988)} is VALID [2022-04-15 06:00:34,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {64363#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64363#(< main_~i~0 987)} is VALID [2022-04-15 06:00:34,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {64370#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64363#(< main_~i~0 987)} is VALID [2022-04-15 06:00:34,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {64370#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64370#(< main_~i~0 986)} is VALID [2022-04-15 06:00:34,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {64377#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64370#(< main_~i~0 986)} is VALID [2022-04-15 06:00:34,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {64377#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64377#(< main_~i~0 985)} is VALID [2022-04-15 06:00:34,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {64384#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64377#(< main_~i~0 985)} is VALID [2022-04-15 06:00:34,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {64384#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64384#(< main_~i~0 984)} is VALID [2022-04-15 06:00:34,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {64391#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64384#(< main_~i~0 984)} is VALID [2022-04-15 06:00:34,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {64391#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64391#(< main_~i~0 983)} is VALID [2022-04-15 06:00:34,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {64398#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64391#(< main_~i~0 983)} is VALID [2022-04-15 06:00:34,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {64398#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64398#(< main_~i~0 982)} is VALID [2022-04-15 06:00:34,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {64405#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64398#(< main_~i~0 982)} is VALID [2022-04-15 06:00:34,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {64405#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64405#(< main_~i~0 981)} is VALID [2022-04-15 06:00:34,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {64412#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64405#(< main_~i~0 981)} is VALID [2022-04-15 06:00:34,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {64412#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64412#(< main_~i~0 980)} is VALID [2022-04-15 06:00:34,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {64419#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64412#(< main_~i~0 980)} is VALID [2022-04-15 06:00:34,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {64419#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64419#(< main_~i~0 979)} is VALID [2022-04-15 06:00:34,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {64426#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64419#(< main_~i~0 979)} is VALID [2022-04-15 06:00:34,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {64426#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64426#(< main_~i~0 978)} is VALID [2022-04-15 06:00:34,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {64433#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64426#(< main_~i~0 978)} is VALID [2022-04-15 06:00:34,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {64433#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64433#(< main_~i~0 977)} is VALID [2022-04-15 06:00:34,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {64440#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64433#(< main_~i~0 977)} is VALID [2022-04-15 06:00:34,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {64440#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64440#(< main_~i~0 976)} is VALID [2022-04-15 06:00:34,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {64447#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64440#(< main_~i~0 976)} is VALID [2022-04-15 06:00:34,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {64447#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64447#(< main_~i~0 975)} is VALID [2022-04-15 06:00:34,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {63671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {64447#(< main_~i~0 975)} is VALID [2022-04-15 06:00:34,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {63671#true} call #t~ret5 := main(); {63671#true} is VALID [2022-04-15 06:00:34,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63671#true} {63671#true} #58#return; {63671#true} is VALID [2022-04-15 06:00:34,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {63671#true} assume true; {63671#true} is VALID [2022-04-15 06:00:34,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {63671#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(10, 2); {63671#true} is VALID [2022-04-15 06:00:34,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {63671#true} call ULTIMATE.init(); {63671#true} is VALID [2022-04-15 06:00:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:34,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433151450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:34,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:34,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 06:00:34,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [72835059] [2022-04-15 06:00:34,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [72835059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:34,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:34,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:00:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921073527] [2022-04-15 06:00:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 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 116 [2022-04-15 06:00:34,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:34,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have 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,236 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 06:00:34,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:00:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:34,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:00:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 06:00:34,238 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have 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:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:42,949 INFO L93 Difference]: Finished difference Result 323 states and 372 transitions. [2022-04-15 06:00:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:00:42,949 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 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 116 [2022-04-15 06:00:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have 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:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 367 transitions. [2022-04-15 06:00:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have 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:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 367 transitions. [2022-04-15 06:00:42,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 367 transitions. [2022-04-15 06:00:43,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:43,277 INFO L225 Difference]: With dead ends: 323 [2022-04-15 06:00:43,277 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 06:00:43,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 06:00:43,293 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 761 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:43,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 41 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 06:00:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 119. [2022-04-15 06:00:44,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:44,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:44,144 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:44,144 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:44,149 INFO L93 Difference]: Finished difference Result 309 states and 357 transitions. [2022-04-15 06:00:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2022-04-15 06:00:44,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:44,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:44,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-15 06:00:44,151 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-15 06:00:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:44,156 INFO L93 Difference]: Finished difference Result 309 states and 357 transitions. [2022-04-15 06:00:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2022-04-15 06:00:44,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:44,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:44,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:44,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 06:00:44,158 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2022-04-15 06:00:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:44,158 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 06:00:44,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have 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:44,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 06:00:44,452 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:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 06:00:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 06:00:44,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:44,453 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:44,481 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:00:44,678 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:00:44,678 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1069489487, now seen corresponding path program 99 times [2022-04-15 06:00:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:44,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207448664] [2022-04-15 06:00:44,683 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:44,683 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:44,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1069489487, now seen corresponding path program 100 times [2022-04-15 06:00:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:44,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96512673] [2022-04-15 06:00:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:45,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {66126#(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(10, 2); {66071#true} is VALID [2022-04-15 06:00:45,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 06:00:45,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 06:00:45,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:45,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {66126#(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(10, 2); {66071#true} is VALID [2022-04-15 06:00:45,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 06:00:45,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 06:00:45,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 06:00:45,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66076#(= main_~i~0 0)} is VALID [2022-04-15 06:00:45,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {66076#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66076#(= main_~i~0 0)} is VALID [2022-04-15 06:00:45,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {66076#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:45,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {66077#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:45,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {66077#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:45,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {66078#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:45,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {66078#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:45,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {66079#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:45,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {66079#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:45,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {66080#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:45,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {66080#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:45,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {66081#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:45,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {66081#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:45,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {66082#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:45,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {66082#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:45,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {66083#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:45,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {66083#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:45,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {66084#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:45,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {66084#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:45,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {66085#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:45,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {66085#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:45,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {66086#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:45,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {66086#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:45,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {66087#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:45,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {66087#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:45,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {66088#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:45,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {66088#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:45,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {66089#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:45,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {66089#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:45,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {66090#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:45,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {66090#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:45,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {66091#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:45,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {66091#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:45,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {66092#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:45,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {66092#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:45,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {66093#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:45,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {66093#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:45,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {66094#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:45,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {66094#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:45,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {66095#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:45,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {66095#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:45,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {66096#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:45,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {66096#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:45,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {66097#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:45,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {66097#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:45,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {66098#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:45,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {66098#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:45,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {66099#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:45,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {66099#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:45,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {66100#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:45,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {66100#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:45,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {66101#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:45,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {66101#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:45,875 INFO L290 TraceCheckUtils]: 58: Hoare triple {66102#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:45,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {66102#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:45,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {66103#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:45,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {66103#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:45,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {66104#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:45,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {66104#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:45,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {66105#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:45,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {66105#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:45,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {66106#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:45,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {66106#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:45,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {66107#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:45,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {66107#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:45,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {66108#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:45,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {66108#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:45,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {66109#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:45,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {66109#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:45,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {66110#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:45,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {66110#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:45,882 INFO L290 TraceCheckUtils]: 76: Hoare triple {66111#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:45,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {66111#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:45,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {66112#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:45,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {66112#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:45,884 INFO L290 TraceCheckUtils]: 80: Hoare triple {66113#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:45,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {66113#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:45,884 INFO L290 TraceCheckUtils]: 82: Hoare triple {66114#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:45,885 INFO L290 TraceCheckUtils]: 83: Hoare triple {66114#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:45,885 INFO L290 TraceCheckUtils]: 84: Hoare triple {66115#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:45,886 INFO L290 TraceCheckUtils]: 85: Hoare triple {66115#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:45,886 INFO L290 TraceCheckUtils]: 86: Hoare triple {66116#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:45,886 INFO L290 TraceCheckUtils]: 87: Hoare triple {66116#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:45,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {66117#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:45,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {66117#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:45,887 INFO L290 TraceCheckUtils]: 90: Hoare triple {66118#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:45,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {66118#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:45,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {66119#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:45,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {66119#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:45,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {66120#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:45,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {66120#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:45,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {66121#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:45,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {66121#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:45,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {66122#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:45,891 INFO L290 TraceCheckUtils]: 99: Hoare triple {66122#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:45,891 INFO L290 TraceCheckUtils]: 100: Hoare triple {66123#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:45,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {66123#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:45,892 INFO L290 TraceCheckUtils]: 102: Hoare triple {66124#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:45,892 INFO L290 TraceCheckUtils]: 103: Hoare triple {66124#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66125#(<= main_~i~0 49)} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 104: Hoare triple {66125#(<= main_~i~0 49)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:45,893 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 06:00:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96512673] [2022-04-15 06:00:45,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96512673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:45,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093535515] [2022-04-15 06:00:45,895 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:45,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:45,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:45,896 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:00:45,898 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:00:46,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:46,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:46,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 06:00:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:46,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:47,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66071#true} is VALID [2022-04-15 06:00:47,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#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(10, 2); {66071#true} is VALID [2022-04-15 06:00:47,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 06:00:47,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 06:00:47,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 06:00:47,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66145#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:47,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {66145#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66145#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:47,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {66145#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:47,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {66077#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66077#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:47,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {66077#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:47,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {66078#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66078#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:47,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {66078#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:47,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {66079#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66079#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:47,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {66079#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:47,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {66080#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66080#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:47,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {66080#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:47,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {66081#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66081#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:47,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {66081#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:47,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {66082#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66082#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:47,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {66082#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:47,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {66083#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66083#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:47,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {66083#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:47,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {66084#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66084#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:47,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {66084#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:47,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {66085#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66085#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:47,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {66085#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:47,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {66086#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66086#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:47,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {66086#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:47,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {66087#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66087#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:47,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {66087#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:47,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {66088#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66088#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:47,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {66088#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:47,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {66089#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66089#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:47,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {66089#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:47,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {66090#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66090#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:47,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {66090#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:47,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {66091#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66091#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:47,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {66091#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:47,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {66092#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66092#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:47,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {66092#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:47,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {66093#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66093#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:47,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {66093#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:47,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {66094#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66094#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:47,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {66094#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:47,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {66095#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66095#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:47,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {66095#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:47,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {66096#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66096#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:47,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {66096#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:47,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {66097#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66097#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:47,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {66097#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:47,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {66098#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66098#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:47,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {66098#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:47,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {66099#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66099#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:47,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {66099#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:47,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {66100#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66100#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:47,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {66100#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:47,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {66101#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66101#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:47,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {66101#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:47,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {66102#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66102#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:47,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {66102#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:47,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {66103#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66103#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:47,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {66103#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:47,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {66104#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66104#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:47,171 INFO L290 TraceCheckUtils]: 63: Hoare triple {66104#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:47,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {66105#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66105#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:47,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {66105#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:47,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {66106#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66106#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:47,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {66106#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:47,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {66107#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66107#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:47,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {66107#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:47,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {66108#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66108#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:47,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {66108#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:47,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {66109#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66109#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:47,175 INFO L290 TraceCheckUtils]: 73: Hoare triple {66109#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:47,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {66110#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66110#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:47,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {66110#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:47,177 INFO L290 TraceCheckUtils]: 76: Hoare triple {66111#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66111#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:47,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {66111#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:47,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {66112#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66112#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:47,178 INFO L290 TraceCheckUtils]: 79: Hoare triple {66112#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:47,178 INFO L290 TraceCheckUtils]: 80: Hoare triple {66113#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66113#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:47,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {66113#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:47,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {66114#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66114#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:47,180 INFO L290 TraceCheckUtils]: 83: Hoare triple {66114#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:47,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {66115#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66115#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:47,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {66115#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:47,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {66116#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66116#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:47,181 INFO L290 TraceCheckUtils]: 87: Hoare triple {66116#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:47,182 INFO L290 TraceCheckUtils]: 88: Hoare triple {66117#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66117#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:47,182 INFO L290 TraceCheckUtils]: 89: Hoare triple {66117#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:47,182 INFO L290 TraceCheckUtils]: 90: Hoare triple {66118#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66118#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:47,183 INFO L290 TraceCheckUtils]: 91: Hoare triple {66118#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:47,183 INFO L290 TraceCheckUtils]: 92: Hoare triple {66119#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66119#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:47,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {66119#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:47,184 INFO L290 TraceCheckUtils]: 94: Hoare triple {66120#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66120#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:47,184 INFO L290 TraceCheckUtils]: 95: Hoare triple {66120#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:47,185 INFO L290 TraceCheckUtils]: 96: Hoare triple {66121#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66121#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:47,185 INFO L290 TraceCheckUtils]: 97: Hoare triple {66121#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:47,185 INFO L290 TraceCheckUtils]: 98: Hoare triple {66122#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66122#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:47,186 INFO L290 TraceCheckUtils]: 99: Hoare triple {66122#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:47,186 INFO L290 TraceCheckUtils]: 100: Hoare triple {66123#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66123#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:47,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {66123#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:47,187 INFO L290 TraceCheckUtils]: 102: Hoare triple {66124#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66124#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:47,187 INFO L290 TraceCheckUtils]: 103: Hoare triple {66124#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66125#(<= main_~i~0 49)} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 104: Hoare triple {66125#(<= main_~i~0 49)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:47,188 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:47,189 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 06:00:47,189 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 06:00:47,189 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 06:00:47,189 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 06:00:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:47,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:51,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {66072#false} assume !false; {66072#false} is VALID [2022-04-15 06:00:51,225 INFO L290 TraceCheckUtils]: 116: Hoare triple {66072#false} assume 0 == ~cond; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 115: Hoare triple {66072#false} ~cond := #in~cond; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L272 TraceCheckUtils]: 114: Hoare triple {66072#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 113: Hoare triple {66072#false} assume !(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 112: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 111: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 110: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 109: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 108: Hoare triple {66072#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 107: Hoare triple {66072#false} assume !!(0 != #t~mem4);havoc #t~mem4; {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 106: Hoare triple {66072#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {66072#false} is VALID [2022-04-15 06:00:51,226 INFO L290 TraceCheckUtils]: 105: Hoare triple {66072#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {66072#false} is VALID [2022-04-15 06:00:51,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {66521#(< main_~i~0 1023)} assume !(~i~0 < 1023); {66072#false} is VALID [2022-04-15 06:00:51,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {66525#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66521#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:51,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {66525#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66525#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:51,228 INFO L290 TraceCheckUtils]: 101: Hoare triple {66532#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66525#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:51,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {66532#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66532#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:51,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {66539#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66532#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:51,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {66539#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66539#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:51,230 INFO L290 TraceCheckUtils]: 97: Hoare triple {66546#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66539#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:51,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {66546#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66546#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:51,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {66553#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66546#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:51,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {66553#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66553#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:51,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {66560#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66553#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:51,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {66560#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66560#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:51,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {66567#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66560#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:51,233 INFO L290 TraceCheckUtils]: 90: Hoare triple {66567#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66567#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:51,233 INFO L290 TraceCheckUtils]: 89: Hoare triple {66574#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66567#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:51,233 INFO L290 TraceCheckUtils]: 88: Hoare triple {66574#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66574#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:51,234 INFO L290 TraceCheckUtils]: 87: Hoare triple {66581#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66574#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:51,234 INFO L290 TraceCheckUtils]: 86: Hoare triple {66581#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66581#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:51,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {66588#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66581#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:51,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {66588#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66588#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:51,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {66595#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66588#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:51,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {66595#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66595#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:51,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {66602#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66595#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:51,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {66602#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66602#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:51,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {66609#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66602#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:51,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {66609#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66609#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:51,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {66616#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66609#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:51,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {66616#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66616#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:51,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {66623#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66616#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:51,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {66623#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66623#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:51,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {66630#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66623#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:51,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {66630#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66630#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:51,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {66637#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66630#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:51,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {66637#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66637#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:51,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {66644#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66637#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:51,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {66644#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66644#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:51,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {66651#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66644#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:51,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {66651#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66651#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:51,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {66658#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66651#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:51,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {66658#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66658#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:51,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {66665#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66658#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:51,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {66665#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66665#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:51,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {66672#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66665#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:51,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {66672#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66672#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:51,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {66679#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66672#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:51,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {66679#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66679#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:51,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {66686#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66679#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:51,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {66686#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66686#(< main_~i~0 999)} is VALID [2022-04-15 06:00:51,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {66693#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66686#(< main_~i~0 999)} is VALID [2022-04-15 06:00:51,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {66693#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66693#(< main_~i~0 998)} is VALID [2022-04-15 06:00:51,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {66700#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66693#(< main_~i~0 998)} is VALID [2022-04-15 06:00:51,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {66700#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66700#(< main_~i~0 997)} is VALID [2022-04-15 06:00:51,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {66707#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66700#(< main_~i~0 997)} is VALID [2022-04-15 06:00:51,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {66707#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66707#(< main_~i~0 996)} is VALID [2022-04-15 06:00:51,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {66714#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66707#(< main_~i~0 996)} is VALID [2022-04-15 06:00:51,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {66714#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66714#(< main_~i~0 995)} is VALID [2022-04-15 06:00:51,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {66721#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66714#(< main_~i~0 995)} is VALID [2022-04-15 06:00:51,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {66721#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66721#(< main_~i~0 994)} is VALID [2022-04-15 06:00:51,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {66728#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66721#(< main_~i~0 994)} is VALID [2022-04-15 06:00:51,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {66728#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66728#(< main_~i~0 993)} is VALID [2022-04-15 06:00:51,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {66735#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66728#(< main_~i~0 993)} is VALID [2022-04-15 06:00:51,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {66735#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66735#(< main_~i~0 992)} is VALID [2022-04-15 06:00:51,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {66742#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66735#(< main_~i~0 992)} is VALID [2022-04-15 06:00:51,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {66742#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66742#(< main_~i~0 991)} is VALID [2022-04-15 06:00:51,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {66749#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66742#(< main_~i~0 991)} is VALID [2022-04-15 06:00:51,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {66749#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66749#(< main_~i~0 990)} is VALID [2022-04-15 06:00:51,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {66756#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66749#(< main_~i~0 990)} is VALID [2022-04-15 06:00:51,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {66756#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66756#(< main_~i~0 989)} is VALID [2022-04-15 06:00:51,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {66763#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66756#(< main_~i~0 989)} is VALID [2022-04-15 06:00:51,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {66763#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66763#(< main_~i~0 988)} is VALID [2022-04-15 06:00:51,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {66770#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66763#(< main_~i~0 988)} is VALID [2022-04-15 06:00:51,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {66770#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66770#(< main_~i~0 987)} is VALID [2022-04-15 06:00:51,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {66777#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66770#(< main_~i~0 987)} is VALID [2022-04-15 06:00:51,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {66777#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66777#(< main_~i~0 986)} is VALID [2022-04-15 06:00:51,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {66784#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66777#(< main_~i~0 986)} is VALID [2022-04-15 06:00:51,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {66784#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66784#(< main_~i~0 985)} is VALID [2022-04-15 06:00:51,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {66791#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66784#(< main_~i~0 985)} is VALID [2022-04-15 06:00:51,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {66791#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66791#(< main_~i~0 984)} is VALID [2022-04-15 06:00:51,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {66798#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66791#(< main_~i~0 984)} is VALID [2022-04-15 06:00:51,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {66798#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66798#(< main_~i~0 983)} is VALID [2022-04-15 06:00:51,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {66805#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66798#(< main_~i~0 983)} is VALID [2022-04-15 06:00:51,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {66805#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66805#(< main_~i~0 982)} is VALID [2022-04-15 06:00:51,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {66812#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66805#(< main_~i~0 982)} is VALID [2022-04-15 06:00:51,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {66812#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66812#(< main_~i~0 981)} is VALID [2022-04-15 06:00:51,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {66819#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66812#(< main_~i~0 981)} is VALID [2022-04-15 06:00:51,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {66819#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66819#(< main_~i~0 980)} is VALID [2022-04-15 06:00:51,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {66826#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66819#(< main_~i~0 980)} is VALID [2022-04-15 06:00:51,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {66826#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66826#(< main_~i~0 979)} is VALID [2022-04-15 06:00:51,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {66833#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66826#(< main_~i~0 979)} is VALID [2022-04-15 06:00:51,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {66833#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66833#(< main_~i~0 978)} is VALID [2022-04-15 06:00:51,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {66840#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66833#(< main_~i~0 978)} is VALID [2022-04-15 06:00:51,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {66840#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66840#(< main_~i~0 977)} is VALID [2022-04-15 06:00:51,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {66847#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66840#(< main_~i~0 977)} is VALID [2022-04-15 06:00:51,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {66847#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66847#(< main_~i~0 976)} is VALID [2022-04-15 06:00:51,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {66854#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66847#(< main_~i~0 976)} is VALID [2022-04-15 06:00:51,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {66854#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66854#(< main_~i~0 975)} is VALID [2022-04-15 06:00:51,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {66861#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {66854#(< main_~i~0 975)} is VALID [2022-04-15 06:00:51,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {66861#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {66861#(< main_~i~0 974)} is VALID [2022-04-15 06:00:51,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {66071#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {66861#(< main_~i~0 974)} is VALID [2022-04-15 06:00:51,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {66071#true} call #t~ret5 := main(); {66071#true} is VALID [2022-04-15 06:00:51,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66071#true} {66071#true} #58#return; {66071#true} is VALID [2022-04-15 06:00:51,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {66071#true} assume true; {66071#true} is VALID [2022-04-15 06:00:51,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {66071#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(10, 2); {66071#true} is VALID [2022-04-15 06:00:51,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {66071#true} call ULTIMATE.init(); {66071#true} is VALID [2022-04-15 06:00:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:00:51,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093535515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:51,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:51,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 06:00:51,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:51,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207448664] [2022-04-15 06:00:51,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207448664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:51,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:51,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:00:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104396202] [2022-04-15 06:00:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 06:00:51,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:51,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have 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:51,388 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 06:00:51,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:00:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:00:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:00:51,391 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have 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:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:01,555 INFO L93 Difference]: Finished difference Result 329 states and 379 transitions. [2022-04-15 06:01:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:01:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 06:01:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have 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:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 374 transitions. [2022-04-15 06:01:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have 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:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 374 transitions. [2022-04-15 06:01:01,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 374 transitions. [2022-04-15 06:01:01,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:01,829 INFO L225 Difference]: With dead ends: 329 [2022-04-15 06:01:01,829 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 06:01:01,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:01:01,830 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 696 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:01,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 41 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:01:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 06:01:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 121. [2022-04-15 06:01:02,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:02,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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:01:02,532 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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:01:02,533 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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:01:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:02,538 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-04-15 06:01:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2022-04-15 06:01:02,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:02,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:02,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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 315 states. [2022-04-15 06:01:02,539 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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 315 states. [2022-04-15 06:01:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:02,544 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-04-15 06:01:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2022-04-15 06:01:02,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:02,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:02,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:02,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 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:01:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2022-04-15 06:01:02,547 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2022-04-15 06:01:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:02,547 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2022-04-15 06:01:02,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have 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:02,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 122 transitions. [2022-04-15 06:01:02,798 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:01:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 06:01:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-15 06:01:02,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:02,799 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:02,816 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:02,999 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:02,999 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1250408787, now seen corresponding path program 101 times [2022-04-15 06:01:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212621898] [2022-04-15 06:01:03,005 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:03,005 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:03,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1250408787, now seen corresponding path program 102 times [2022-04-15 06:01:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:03,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571891581] [2022-04-15 06:01:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:04,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {68571#(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(10, 2); {68515#true} is VALID [2022-04-15 06:01:04,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 06:01:04,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 06:01:04,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:04,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {68571#(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(10, 2); {68515#true} is VALID [2022-04-15 06:01:04,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 06:01:04,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 06:01:04,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 06:01:04,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68520#(= main_~i~0 0)} is VALID [2022-04-15 06:01:04,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {68520#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68520#(= main_~i~0 0)} is VALID [2022-04-15 06:01:04,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {68520#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:04,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {68521#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:04,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {68521#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:04,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {68522#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:04,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {68522#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68523#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:04,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {68523#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68523#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:04,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {68523#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68524#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:04,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {68524#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68524#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:04,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {68524#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68525#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:04,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {68525#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68525#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:04,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {68525#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68526#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:04,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {68526#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68526#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:04,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {68526#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68527#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:04,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {68527#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68527#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:04,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {68527#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68528#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:04,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {68528#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68528#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:04,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {68528#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68529#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:04,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {68529#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68529#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:04,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {68529#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68530#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:04,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {68530#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68530#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:04,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {68530#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68531#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:04,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {68531#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68531#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:04,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {68531#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68532#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:04,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {68532#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68532#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:04,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {68532#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68533#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:04,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {68533#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68533#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:04,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {68533#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68534#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:04,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {68534#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68534#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:04,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {68534#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68535#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:04,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {68535#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68535#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:04,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {68535#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68536#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:04,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {68536#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68536#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:04,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {68536#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68537#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:04,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {68537#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68537#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:04,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {68537#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68538#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:04,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {68538#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68538#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:04,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {68538#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68539#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:04,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {68539#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68539#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:04,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {68539#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68540#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:04,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {68540#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68540#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:04,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {68540#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68541#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:04,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {68541#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68541#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:04,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {68541#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68542#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:04,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {68542#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68542#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:04,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {68542#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68543#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:04,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {68543#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68543#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:04,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {68543#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68544#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:04,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {68544#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68544#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:04,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {68544#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68545#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:04,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {68545#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68545#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:04,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {68545#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68546#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:04,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {68546#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68546#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:04,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {68546#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68547#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:04,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {68547#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68547#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:04,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {68547#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68548#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:04,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {68548#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68548#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:04,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {68548#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68549#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:04,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {68549#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68549#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:04,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {68549#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68550#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:04,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {68550#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68550#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:04,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {68550#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68551#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:04,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {68551#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68551#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:04,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {68551#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68552#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:04,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {68552#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68552#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:04,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {68552#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68553#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:04,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {68553#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68553#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:04,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {68553#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68554#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:04,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {68554#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68554#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:04,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {68554#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68555#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:04,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {68555#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68555#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:04,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {68555#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68556#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:04,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {68556#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68556#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:04,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {68556#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68557#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:04,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {68557#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68557#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:04,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {68557#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68558#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:04,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {68558#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68558#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:04,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {68558#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68559#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:04,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {68559#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68559#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:04,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {68559#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68560#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:04,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {68560#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68560#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:04,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {68560#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68561#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:04,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {68561#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68561#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:04,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {68561#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68562#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:04,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {68562#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68562#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:04,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {68562#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68563#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:04,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {68563#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68563#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:04,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {68563#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68564#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:04,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {68564#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68564#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:04,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {68564#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68565#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:04,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {68565#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68565#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:04,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {68565#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68566#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:04,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {68566#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68566#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:04,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {68566#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68567#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:04,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {68567#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68567#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:04,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {68567#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68568#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:04,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {68568#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68568#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:04,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {68568#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68569#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:04,171 INFO L290 TraceCheckUtils]: 104: Hoare triple {68569#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68569#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:04,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {68569#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68570#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:04,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {68570#(<= main_~i~0 50)} assume !(~i~0 < 1023); {68516#false} is VALID [2022-04-15 06:01:04,171 INFO L290 TraceCheckUtils]: 107: Hoare triple {68516#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 109: Hoare triple {68516#false} assume !!(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 110: Hoare triple {68516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 111: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 112: Hoare triple {68516#false} assume !!(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 113: Hoare triple {68516#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 114: Hoare triple {68516#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 115: Hoare triple {68516#false} assume !(0 != #t~mem4);havoc #t~mem4; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L272 TraceCheckUtils]: 116: Hoare triple {68516#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 117: Hoare triple {68516#false} ~cond := #in~cond; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 118: Hoare triple {68516#false} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 06:01:04,172 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 06:01:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571891581] [2022-04-15 06:01:04,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571891581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917399117] [2022-04-15 06:01:04,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:04,174 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:04,175 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:04,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:01:04,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:04,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:01:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:04,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:04,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#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(10, 2); {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 80: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 81: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 82: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 92: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 93: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 94: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 95: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 97: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,775 INFO L290 TraceCheckUtils]: 98: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 101: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 102: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 103: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 104: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 105: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 106: Hoare triple {68515#true} assume !(~i~0 < 1023); {68515#true} is VALID [2022-04-15 06:01:04,776 INFO L290 TraceCheckUtils]: 107: Hoare triple {68515#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68896#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:04,777 INFO L290 TraceCheckUtils]: 108: Hoare triple {68896#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68896#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:04,777 INFO L290 TraceCheckUtils]: 109: Hoare triple {68896#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {68896#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:04,777 INFO L290 TraceCheckUtils]: 110: Hoare triple {68896#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:04,778 INFO L290 TraceCheckUtils]: 111: Hoare triple {68521#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68521#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:04,778 INFO L290 TraceCheckUtils]: 112: Hoare triple {68521#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {68521#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:04,778 INFO L290 TraceCheckUtils]: 113: Hoare triple {68521#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:04,779 INFO L290 TraceCheckUtils]: 114: Hoare triple {68522#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68522#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:04,779 INFO L290 TraceCheckUtils]: 115: Hoare triple {68522#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {68522#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:04,779 INFO L272 TraceCheckUtils]: 116: Hoare triple {68522#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:04,780 INFO L290 TraceCheckUtils]: 117: Hoare triple {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:04,780 INFO L290 TraceCheckUtils]: 118: Hoare triple {68928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 06:01:04,780 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 06:01:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 06:01:04,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:05,116 INFO L290 TraceCheckUtils]: 119: Hoare triple {68516#false} assume !false; {68516#false} is VALID [2022-04-15 06:01:05,117 INFO L290 TraceCheckUtils]: 118: Hoare triple {68928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {68516#false} is VALID [2022-04-15 06:01:05,117 INFO L290 TraceCheckUtils]: 117: Hoare triple {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {68928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:05,118 INFO L272 TraceCheckUtils]: 116: Hoare triple {68944#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {68924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:05,118 INFO L290 TraceCheckUtils]: 115: Hoare triple {68944#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:05,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {68944#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:05,119 INFO L290 TraceCheckUtils]: 113: Hoare triple {68954#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68944#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:05,119 INFO L290 TraceCheckUtils]: 112: Hoare triple {68954#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:05,119 INFO L290 TraceCheckUtils]: 111: Hoare triple {68954#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:05,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {68964#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {68954#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:05,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {68964#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:05,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {68964#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:05,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {68515#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {68964#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 106: Hoare triple {68515#true} assume !(~i~0 < 1023); {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 105: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 104: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 103: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 102: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 101: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 100: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 99: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 98: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 97: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 96: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 95: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 94: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,121 INFO L290 TraceCheckUtils]: 93: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 91: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 90: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 86: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 85: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 84: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 83: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 82: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 69: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 68: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 63: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 62: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {68515#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {68515#true} is VALID [2022-04-15 06:01:05,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {68515#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {68515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {68515#true} call #t~ret5 := main(); {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68515#true} {68515#true} #58#return; {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {68515#true} assume true; {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {68515#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(10, 2); {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {68515#true} call ULTIMATE.init(); {68515#true} is VALID [2022-04-15 06:01:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2507 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 06:01:05,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917399117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:05,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:05,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 7, 7] total 60 [2022-04-15 06:01:05,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:05,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212621898] [2022-04-15 06:01:05,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212621898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:05,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:05,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:01:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835672932] [2022-04-15 06:01:05,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 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 120 [2022-04-15 06:01:05,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:05,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have 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:05,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:05,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:01:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:01:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=1938, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:01:05,206 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have 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,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:14,586 INFO L93 Difference]: Finished difference Result 335 states and 386 transitions. [2022-04-15 06:01:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:01:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 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 120 [2022-04-15 06:01:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 381 transitions. [2022-04-15 06:01:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have 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,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 381 transitions. [2022-04-15 06:01:14,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 381 transitions. [2022-04-15 06:01:14,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:14,919 INFO L225 Difference]: With dead ends: 335 [2022-04-15 06:01:14,919 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 06:01:14,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 235 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:14,920 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 874 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:14,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [874 Valid, 26 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:01:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 06:01:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 123. [2022-04-15 06:01:15,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:15,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:15,863 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:15,863 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:15,869 INFO L93 Difference]: Finished difference Result 321 states and 371 transitions. [2022-04-15 06:01:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2022-04-15 06:01:15,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:15,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:15,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 06:01:15,870 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 06:01:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:15,875 INFO L93 Difference]: Finished difference Result 321 states and 371 transitions. [2022-04-15 06:01:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2022-04-15 06:01:15,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:15,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:15,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:15,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-04-15 06:01:15,878 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2022-04-15 06:01:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:15,889 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-04-15 06:01:15,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have 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:15,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 124 transitions. [2022-04-15 06:01:16,213 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:01:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2022-04-15 06:01:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:01:16,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:16,214 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:16,241 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:16,438 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:16,439 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1584623477, now seen corresponding path program 103 times [2022-04-15 06:01:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:16,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6829161] [2022-04-15 06:01:16,443 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:16,443 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:16,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1584623477, now seen corresponding path program 104 times [2022-04-15 06:01:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82479619] [2022-04-15 06:01:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:17,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {71014#(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(10, 2); {70957#true} is VALID [2022-04-15 06:01:17,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 06:01:17,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 06:01:17,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {71014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:17,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {71014#(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(10, 2); {70957#true} is VALID [2022-04-15 06:01:17,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 06:01:17,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 06:01:17,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 06:01:17,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70962#(= main_~i~0 0)} is VALID [2022-04-15 06:01:17,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {70962#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70962#(= main_~i~0 0)} is VALID [2022-04-15 06:01:17,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {70962#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:17,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {70963#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:17,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {70963#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:17,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {70964#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:17,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {70964#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:17,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {70965#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:17,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {70965#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:17,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {70966#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:17,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {70966#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:17,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {70967#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:17,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {70967#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:17,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {70968#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:17,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {70968#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:17,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {70969#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:17,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {70969#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:17,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {70970#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:17,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {70970#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:17,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {70971#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:17,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {70971#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:17,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {70972#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:17,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {70972#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:17,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {70973#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:17,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {70973#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:17,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {70974#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:17,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {70974#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:17,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {70975#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:17,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {70975#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:17,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {70976#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:17,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {70976#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:17,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {70977#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:17,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {70977#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:17,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {70978#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:17,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {70978#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:17,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {70979#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:17,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {70979#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:17,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {70980#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:17,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {70980#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:17,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {70981#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:17,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {70981#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:17,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {70982#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:17,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {70982#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:17,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {70983#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:17,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {70983#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:17,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {70984#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:17,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {70984#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:17,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {70985#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:17,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {70985#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:17,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {70986#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:17,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {70986#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:17,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {70987#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:17,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {70987#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:17,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {70988#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:17,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {70988#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:17,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {70989#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:17,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {70989#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:17,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {70990#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:17,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {70990#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:17,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {70991#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:17,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {70991#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:17,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {70992#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:17,874 INFO L290 TraceCheckUtils]: 67: Hoare triple {70992#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:17,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {70993#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:17,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {70993#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:17,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {70994#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:17,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {70994#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:17,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {70995#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:17,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {70995#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:17,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {70996#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:17,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {70996#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:17,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {70997#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:17,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {70997#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:17,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {70998#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:17,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {70998#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:17,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {70999#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:17,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {70999#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:17,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {71000#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:17,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {71000#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:17,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {71001#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:17,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {71001#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:17,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {71002#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:17,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {71002#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:17,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {71003#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:17,882 INFO L290 TraceCheckUtils]: 89: Hoare triple {71003#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:17,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {71004#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:17,883 INFO L290 TraceCheckUtils]: 91: Hoare triple {71004#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:17,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {71005#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:17,884 INFO L290 TraceCheckUtils]: 93: Hoare triple {71005#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:17,884 INFO L290 TraceCheckUtils]: 94: Hoare triple {71006#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:17,885 INFO L290 TraceCheckUtils]: 95: Hoare triple {71006#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:17,885 INFO L290 TraceCheckUtils]: 96: Hoare triple {71007#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:17,886 INFO L290 TraceCheckUtils]: 97: Hoare triple {71007#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:17,886 INFO L290 TraceCheckUtils]: 98: Hoare triple {71008#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:17,886 INFO L290 TraceCheckUtils]: 99: Hoare triple {71008#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:17,887 INFO L290 TraceCheckUtils]: 100: Hoare triple {71009#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:17,887 INFO L290 TraceCheckUtils]: 101: Hoare triple {71009#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:17,888 INFO L290 TraceCheckUtils]: 102: Hoare triple {71010#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:17,888 INFO L290 TraceCheckUtils]: 103: Hoare triple {71010#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:17,888 INFO L290 TraceCheckUtils]: 104: Hoare triple {71011#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:17,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {71011#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:17,889 INFO L290 TraceCheckUtils]: 106: Hoare triple {71012#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {71012#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71013#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {71013#(<= main_~i~0 51)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:17,890 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 06:01:17,891 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 06:01:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82479619] [2022-04-15 06:01:17,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82479619] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844733837] [2022-04-15 06:01:17,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:17,894 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:17,895 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:18,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:18,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:18,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 06:01:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:19,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {70957#true} is VALID [2022-04-15 06:01:19,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#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(10, 2); {70957#true} is VALID [2022-04-15 06:01:19,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 06:01:19,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 06:01:19,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 06:01:19,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {71033#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:19,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {71033#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71033#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:19,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {71033#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:19,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {70963#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70963#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:19,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {70963#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:19,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {70964#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70964#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:19,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {70964#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:19,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {70965#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70965#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:19,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {70965#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:19,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {70966#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70966#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:19,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {70966#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:19,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {70967#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70967#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:19,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {70967#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:19,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {70968#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70968#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:19,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {70968#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:19,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {70969#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70969#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:19,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {70969#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:19,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {70970#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70970#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:19,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {70970#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:19,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {70971#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70971#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:19,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {70971#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:19,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {70972#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70972#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:19,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {70972#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:19,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {70973#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70973#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:19,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {70973#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:19,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {70974#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70974#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:19,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {70974#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:19,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {70975#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70975#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:19,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {70975#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:19,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {70976#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70976#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:19,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {70976#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:19,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {70977#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70977#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:19,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {70977#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:19,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {70978#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70978#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:19,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {70978#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:19,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {70979#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70979#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:19,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {70979#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:19,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {70980#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70980#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:19,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {70980#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:19,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {70981#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70981#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:19,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {70981#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:19,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {70982#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70982#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:19,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {70982#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:19,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {70983#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70983#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:19,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {70983#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:19,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {70984#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70984#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:19,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {70984#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:19,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {70985#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70985#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:19,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {70985#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:19,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {70986#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70986#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:19,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {70986#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:19,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {70987#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70987#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:19,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {70987#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:19,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {70988#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70988#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:19,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {70988#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:19,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {70989#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70989#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:19,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {70989#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:19,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {70990#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70990#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:19,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {70990#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:19,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {70991#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70991#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:19,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {70991#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:19,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {70992#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70992#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:19,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {70992#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:19,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {70993#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70993#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:19,228 INFO L290 TraceCheckUtils]: 69: Hoare triple {70993#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:19,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {70994#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70994#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:19,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {70994#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:19,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {70995#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70995#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:19,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {70995#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:19,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {70996#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70996#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:19,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {70996#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:19,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {70997#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70997#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:19,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {70997#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:19,232 INFO L290 TraceCheckUtils]: 78: Hoare triple {70998#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70998#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:19,232 INFO L290 TraceCheckUtils]: 79: Hoare triple {70998#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:19,232 INFO L290 TraceCheckUtils]: 80: Hoare triple {70999#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70999#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:19,233 INFO L290 TraceCheckUtils]: 81: Hoare triple {70999#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:19,233 INFO L290 TraceCheckUtils]: 82: Hoare triple {71000#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71000#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:19,234 INFO L290 TraceCheckUtils]: 83: Hoare triple {71000#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:19,234 INFO L290 TraceCheckUtils]: 84: Hoare triple {71001#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71001#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:19,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {71001#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:19,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {71002#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71002#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:19,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {71002#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:19,236 INFO L290 TraceCheckUtils]: 88: Hoare triple {71003#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71003#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:19,236 INFO L290 TraceCheckUtils]: 89: Hoare triple {71003#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:19,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {71004#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71004#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:19,237 INFO L290 TraceCheckUtils]: 91: Hoare triple {71004#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:19,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {71005#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71005#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:19,238 INFO L290 TraceCheckUtils]: 93: Hoare triple {71005#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:19,238 INFO L290 TraceCheckUtils]: 94: Hoare triple {71006#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71006#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:19,239 INFO L290 TraceCheckUtils]: 95: Hoare triple {71006#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:19,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {71007#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71007#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:19,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {71007#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:19,240 INFO L290 TraceCheckUtils]: 98: Hoare triple {71008#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71008#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:19,240 INFO L290 TraceCheckUtils]: 99: Hoare triple {71008#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:19,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {71009#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71009#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:19,241 INFO L290 TraceCheckUtils]: 101: Hoare triple {71009#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:19,244 INFO L290 TraceCheckUtils]: 102: Hoare triple {71010#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71010#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:19,244 INFO L290 TraceCheckUtils]: 103: Hoare triple {71010#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:19,244 INFO L290 TraceCheckUtils]: 104: Hoare triple {71011#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71011#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:19,245 INFO L290 TraceCheckUtils]: 105: Hoare triple {71011#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:19,245 INFO L290 TraceCheckUtils]: 106: Hoare triple {71012#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71012#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 107: Hoare triple {71012#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71013#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 108: Hoare triple {71013#(<= main_~i~0 51)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:19,246 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 06:01:19,247 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 06:01:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:19,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:23,054 INFO L290 TraceCheckUtils]: 121: Hoare triple {70958#false} assume !false; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 120: Hoare triple {70958#false} assume 0 == ~cond; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 119: Hoare triple {70958#false} ~cond := #in~cond; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L272 TraceCheckUtils]: 118: Hoare triple {70958#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 117: Hoare triple {70958#false} assume !(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 116: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 115: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 114: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:23,055 INFO L290 TraceCheckUtils]: 113: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:23,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {70958#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70958#false} is VALID [2022-04-15 06:01:23,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {70958#false} assume !!(0 != #t~mem4);havoc #t~mem4; {70958#false} is VALID [2022-04-15 06:01:23,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {70958#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {70958#false} is VALID [2022-04-15 06:01:23,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {70958#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {70958#false} is VALID [2022-04-15 06:01:23,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {71421#(< main_~i~0 1023)} assume !(~i~0 < 1023); {70958#false} is VALID [2022-04-15 06:01:23,057 INFO L290 TraceCheckUtils]: 107: Hoare triple {71425#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71421#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:23,057 INFO L290 TraceCheckUtils]: 106: Hoare triple {71425#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71425#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:23,058 INFO L290 TraceCheckUtils]: 105: Hoare triple {71432#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71425#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:23,058 INFO L290 TraceCheckUtils]: 104: Hoare triple {71432#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71432#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:23,058 INFO L290 TraceCheckUtils]: 103: Hoare triple {71439#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71432#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:23,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {71439#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71439#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:23,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {71446#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71439#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:23,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {71446#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71446#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:23,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {71453#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71446#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:23,060 INFO L290 TraceCheckUtils]: 98: Hoare triple {71453#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71453#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:23,061 INFO L290 TraceCheckUtils]: 97: Hoare triple {71460#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71453#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:23,061 INFO L290 TraceCheckUtils]: 96: Hoare triple {71460#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71460#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:23,062 INFO L290 TraceCheckUtils]: 95: Hoare triple {71467#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71460#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:23,062 INFO L290 TraceCheckUtils]: 94: Hoare triple {71467#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71467#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:23,063 INFO L290 TraceCheckUtils]: 93: Hoare triple {71474#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71467#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:23,063 INFO L290 TraceCheckUtils]: 92: Hoare triple {71474#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71474#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:23,063 INFO L290 TraceCheckUtils]: 91: Hoare triple {71481#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71474#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:23,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {71481#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71481#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:23,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {71488#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71481#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:23,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {71488#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71488#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:23,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {71495#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71488#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:23,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {71495#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71495#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:23,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {71502#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71495#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:23,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {71502#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71502#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:23,067 INFO L290 TraceCheckUtils]: 83: Hoare triple {71509#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71502#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:23,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {71509#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71509#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:23,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {71516#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71509#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:23,068 INFO L290 TraceCheckUtils]: 80: Hoare triple {71516#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71516#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:23,068 INFO L290 TraceCheckUtils]: 79: Hoare triple {71523#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71516#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:23,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {71523#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71523#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:23,069 INFO L290 TraceCheckUtils]: 77: Hoare triple {71530#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71523#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:23,069 INFO L290 TraceCheckUtils]: 76: Hoare triple {71530#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71530#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:23,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {71537#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71530#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:23,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {71537#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71537#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:23,071 INFO L290 TraceCheckUtils]: 73: Hoare triple {71544#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71537#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:23,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {71544#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71544#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:23,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {71551#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71544#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:23,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {71551#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71551#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:23,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {71558#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71551#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:23,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {71558#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71558#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:23,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {71565#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71558#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:23,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {71565#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71565#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:23,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {71572#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71565#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:23,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {71572#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71572#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:23,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {71579#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71572#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:23,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {71579#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71579#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:23,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {71586#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71579#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:23,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {71586#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71586#(< main_~i~0 999)} is VALID [2022-04-15 06:01:23,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {71593#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71586#(< main_~i~0 999)} is VALID [2022-04-15 06:01:23,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {71593#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71593#(< main_~i~0 998)} is VALID [2022-04-15 06:01:23,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {71600#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71593#(< main_~i~0 998)} is VALID [2022-04-15 06:01:23,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {71600#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71600#(< main_~i~0 997)} is VALID [2022-04-15 06:01:23,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {71607#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71600#(< main_~i~0 997)} is VALID [2022-04-15 06:01:23,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {71607#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71607#(< main_~i~0 996)} is VALID [2022-04-15 06:01:23,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {71614#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71607#(< main_~i~0 996)} is VALID [2022-04-15 06:01:23,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {71614#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71614#(< main_~i~0 995)} is VALID [2022-04-15 06:01:23,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {71621#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71614#(< main_~i~0 995)} is VALID [2022-04-15 06:01:23,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {71621#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71621#(< main_~i~0 994)} is VALID [2022-04-15 06:01:23,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {71628#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71621#(< main_~i~0 994)} is VALID [2022-04-15 06:01:23,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {71628#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71628#(< main_~i~0 993)} is VALID [2022-04-15 06:01:23,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {71635#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71628#(< main_~i~0 993)} is VALID [2022-04-15 06:01:23,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {71635#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71635#(< main_~i~0 992)} is VALID [2022-04-15 06:01:23,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {71642#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71635#(< main_~i~0 992)} is VALID [2022-04-15 06:01:23,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {71642#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71642#(< main_~i~0 991)} is VALID [2022-04-15 06:01:23,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {71649#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71642#(< main_~i~0 991)} is VALID [2022-04-15 06:01:23,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {71649#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71649#(< main_~i~0 990)} is VALID [2022-04-15 06:01:23,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {71656#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71649#(< main_~i~0 990)} is VALID [2022-04-15 06:01:23,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {71656#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71656#(< main_~i~0 989)} is VALID [2022-04-15 06:01:23,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {71663#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71656#(< main_~i~0 989)} is VALID [2022-04-15 06:01:23,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {71663#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71663#(< main_~i~0 988)} is VALID [2022-04-15 06:01:23,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {71670#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71663#(< main_~i~0 988)} is VALID [2022-04-15 06:01:23,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {71670#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71670#(< main_~i~0 987)} is VALID [2022-04-15 06:01:23,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {71677#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71670#(< main_~i~0 987)} is VALID [2022-04-15 06:01:23,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {71677#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71677#(< main_~i~0 986)} is VALID [2022-04-15 06:01:23,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {71684#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71677#(< main_~i~0 986)} is VALID [2022-04-15 06:01:23,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {71684#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71684#(< main_~i~0 985)} is VALID [2022-04-15 06:01:23,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {71691#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71684#(< main_~i~0 985)} is VALID [2022-04-15 06:01:23,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {71691#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71691#(< main_~i~0 984)} is VALID [2022-04-15 06:01:23,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {71698#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71691#(< main_~i~0 984)} is VALID [2022-04-15 06:01:23,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {71698#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71698#(< main_~i~0 983)} is VALID [2022-04-15 06:01:23,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {71705#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71698#(< main_~i~0 983)} is VALID [2022-04-15 06:01:23,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {71705#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71705#(< main_~i~0 982)} is VALID [2022-04-15 06:01:23,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {71712#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71705#(< main_~i~0 982)} is VALID [2022-04-15 06:01:23,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {71712#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71712#(< main_~i~0 981)} is VALID [2022-04-15 06:01:23,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {71719#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71712#(< main_~i~0 981)} is VALID [2022-04-15 06:01:23,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {71719#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71719#(< main_~i~0 980)} is VALID [2022-04-15 06:01:23,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {71726#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71719#(< main_~i~0 980)} is VALID [2022-04-15 06:01:23,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {71726#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71726#(< main_~i~0 979)} is VALID [2022-04-15 06:01:23,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {71733#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71726#(< main_~i~0 979)} is VALID [2022-04-15 06:01:23,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {71733#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71733#(< main_~i~0 978)} is VALID [2022-04-15 06:01:23,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {71740#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71733#(< main_~i~0 978)} is VALID [2022-04-15 06:01:23,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {71740#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71740#(< main_~i~0 977)} is VALID [2022-04-15 06:01:23,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {71747#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71740#(< main_~i~0 977)} is VALID [2022-04-15 06:01:23,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {71747#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71747#(< main_~i~0 976)} is VALID [2022-04-15 06:01:23,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {71754#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71747#(< main_~i~0 976)} is VALID [2022-04-15 06:01:23,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {71754#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71754#(< main_~i~0 975)} is VALID [2022-04-15 06:01:23,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {71761#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71754#(< main_~i~0 975)} is VALID [2022-04-15 06:01:23,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {71761#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71761#(< main_~i~0 974)} is VALID [2022-04-15 06:01:23,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {71768#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71761#(< main_~i~0 974)} is VALID [2022-04-15 06:01:23,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {71768#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71768#(< main_~i~0 973)} is VALID [2022-04-15 06:01:23,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {71775#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {71768#(< main_~i~0 973)} is VALID [2022-04-15 06:01:23,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {71775#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {71775#(< main_~i~0 972)} is VALID [2022-04-15 06:01:23,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {70957#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {71775#(< main_~i~0 972)} is VALID [2022-04-15 06:01:23,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {70957#true} call #t~ret5 := main(); {70957#true} is VALID [2022-04-15 06:01:23,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70957#true} {70957#true} #58#return; {70957#true} is VALID [2022-04-15 06:01:23,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {70957#true} assume true; {70957#true} is VALID [2022-04-15 06:01:23,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {70957#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(10, 2); {70957#true} is VALID [2022-04-15 06:01:23,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {70957#true} call ULTIMATE.init(); {70957#true} is VALID [2022-04-15 06:01:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:23,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844733837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:23,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:23,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-15 06:01:23,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:23,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6829161] [2022-04-15 06:01:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6829161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:23,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:01:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636927950] [2022-04-15 06:01:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 06:01:23,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:23,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have 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:23,190 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 06:01:23,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:01:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:01:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 06:01:23,193 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have 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:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:33,910 INFO L93 Difference]: Finished difference Result 341 states and 393 transitions. [2022-04-15 06:01:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:01:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 06:01:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have 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:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 388 transitions. [2022-04-15 06:01:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have 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:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 388 transitions. [2022-04-15 06:01:33,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 388 transitions. [2022-04-15 06:01:34,192 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 06:01:34,196 INFO L225 Difference]: With dead ends: 341 [2022-04-15 06:01:34,196 INFO L226 Difference]: Without dead ends: 327 [2022-04-15 06:01:34,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 06:01:34,198 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 623 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:34,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 91 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:01:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-15 06:01:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 125. [2022-04-15 06:01:35,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:35,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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:35,271 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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:35,271 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:35,276 INFO L93 Difference]: Finished difference Result 327 states and 378 transitions. [2022-04-15 06:01:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2022-04-15 06:01:35,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:35,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:35,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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 327 states. [2022-04-15 06:01:35,277 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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 327 states. [2022-04-15 06:01:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:35,283 INFO L93 Difference]: Finished difference Result 327 states and 378 transitions. [2022-04-15 06:01:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2022-04-15 06:01:35,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:35,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:35,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:35,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 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:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2022-04-15 06:01:35,285 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2022-04-15 06:01:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:35,285 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2022-04-15 06:01:35,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 2 states have call successors, (3), 3 states have 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:35,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 126 transitions. [2022-04-15 06:01:35,599 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:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 06:01:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 06:01:35,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:35,600 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:35,628 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:01:35,826 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:01:35,826 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 642393367, now seen corresponding path program 105 times [2022-04-15 06:01:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:35,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323961545] [2022-04-15 06:01:35,838 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:35,839 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:35,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 642393367, now seen corresponding path program 106 times [2022-04-15 06:01:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:35,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384064755] [2022-04-15 06:01:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:37,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {73547#(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(10, 2); {73489#true} is VALID [2022-04-15 06:01:37,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 06:01:37,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 06:01:37,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:37,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {73547#(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(10, 2); {73489#true} is VALID [2022-04-15 06:01:37,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 06:01:37,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 06:01:37,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 06:01:37,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73494#(= main_~i~0 0)} is VALID [2022-04-15 06:01:37,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {73494#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73494#(= main_~i~0 0)} is VALID [2022-04-15 06:01:37,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {73494#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:37,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {73495#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:37,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {73495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:37,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {73496#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:37,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {73496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:37,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {73497#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {73497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {73498#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {73498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:37,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {73499#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:37,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {73499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:37,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {73500#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:37,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {73500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:37,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {73501#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:37,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {73501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:37,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {73502#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:37,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {73502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:37,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {73503#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:37,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {73503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:37,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {73504#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:37,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {73504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:37,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {73505#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:37,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {73505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:37,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:37,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {73506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:37,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {73507#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:37,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {73507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {73508#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {73508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:37,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {73509#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:37,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {73509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:37,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {73510#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:37,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {73510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:37,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {73511#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:37,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {73511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:37,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {73512#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:37,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {73512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:37,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {73513#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:37,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {73513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:37,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {73514#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:37,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {73514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:37,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {73515#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:37,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {73515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:37,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {73516#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:37,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {73516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:37,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {73517#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:37,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {73517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:37,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {73518#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:37,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {73518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:37,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {73519#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:37,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {73519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:37,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {73520#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:37,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {73520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:37,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {73521#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:37,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {73521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:37,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {73522#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:37,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {73522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:37,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {73523#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:37,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {73523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:37,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {73524#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:37,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {73524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:37,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {73525#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:37,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {73525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:37,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {73526#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:37,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {73526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:37,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {73527#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:37,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {73527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:37,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {73528#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:37,333 INFO L290 TraceCheckUtils]: 75: Hoare triple {73528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:37,333 INFO L290 TraceCheckUtils]: 76: Hoare triple {73529#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:37,334 INFO L290 TraceCheckUtils]: 77: Hoare triple {73529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:37,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {73530#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:37,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {73530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:37,335 INFO L290 TraceCheckUtils]: 80: Hoare triple {73531#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:37,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {73531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:37,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {73532#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:37,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {73532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:37,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {73533#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:37,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {73533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:37,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {73534#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:37,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {73534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:37,338 INFO L290 TraceCheckUtils]: 88: Hoare triple {73535#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:37,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {73535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:37,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {73536#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:37,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {73536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:37,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {73537#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:37,340 INFO L290 TraceCheckUtils]: 93: Hoare triple {73537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:37,340 INFO L290 TraceCheckUtils]: 94: Hoare triple {73538#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:37,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {73538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:37,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {73539#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:37,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {73539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:37,342 INFO L290 TraceCheckUtils]: 98: Hoare triple {73540#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:37,342 INFO L290 TraceCheckUtils]: 99: Hoare triple {73540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:37,343 INFO L290 TraceCheckUtils]: 100: Hoare triple {73541#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:37,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {73541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:37,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {73542#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:37,344 INFO L290 TraceCheckUtils]: 103: Hoare triple {73542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:37,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {73543#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:37,345 INFO L290 TraceCheckUtils]: 105: Hoare triple {73543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:37,345 INFO L290 TraceCheckUtils]: 106: Hoare triple {73544#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:37,345 INFO L290 TraceCheckUtils]: 107: Hoare triple {73544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:37,346 INFO L290 TraceCheckUtils]: 108: Hoare triple {73545#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:37,346 INFO L290 TraceCheckUtils]: 109: Hoare triple {73545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73546#(<= main_~i~0 52)} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 110: Hoare triple {73546#(<= main_~i~0 52)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:37,347 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:37,348 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 06:01:37,348 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 06:01:37,348 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 06:01:37,348 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 06:01:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384064755] [2022-04-15 06:01:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384064755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577031520] [2022-04-15 06:01:37,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:37,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:37,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:37,350 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:01:37,352 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:01:37,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:37,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:37,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 06:01:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:37,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:38,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73489#true} is VALID [2022-04-15 06:01:38,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#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(10, 2); {73489#true} is VALID [2022-04-15 06:01:38,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 06:01:38,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 06:01:38,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 06:01:38,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73566#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:38,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {73566#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73566#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:38,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {73566#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:38,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {73495#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73495#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:38,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {73495#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:38,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {73496#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73496#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:38,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {73496#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:38,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {73497#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73497#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:38,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {73497#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:38,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {73498#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73498#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:38,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {73498#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:38,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {73499#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73499#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:38,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {73499#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:38,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {73500#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73500#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:38,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {73500#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:38,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {73501#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73501#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:38,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {73501#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:38,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {73502#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73502#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:38,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {73502#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:38,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {73503#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73503#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:38,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {73503#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:38,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {73504#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73504#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:38,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {73504#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:38,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {73505#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73505#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:38,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {73505#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:38,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73506#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:38,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {73506#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:38,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {73507#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73507#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:38,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {73507#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:38,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {73508#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73508#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:38,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {73508#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:38,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {73509#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73509#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:38,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {73509#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:38,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {73510#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73510#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:38,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {73510#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:38,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {73511#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73511#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:38,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {73511#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:38,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {73512#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73512#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:38,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {73512#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:38,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {73513#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73513#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:38,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {73513#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:38,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {73514#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73514#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:38,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {73514#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:38,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {73515#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73515#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:38,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {73515#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:38,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {73516#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73516#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:38,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {73516#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:38,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {73517#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73517#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:38,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {73517#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:38,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {73518#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73518#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:38,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {73518#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:38,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {73519#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73519#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:38,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {73519#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:38,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {73520#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73520#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:38,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {73520#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:38,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {73521#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73521#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:38,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {73521#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:38,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {73522#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73522#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:38,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {73522#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:38,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {73523#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73523#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:38,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {73523#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:38,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {73524#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73524#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:38,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {73524#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:38,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {73525#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73525#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:38,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {73525#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:38,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {73526#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73526#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:38,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {73526#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:38,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {73527#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73527#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:38,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {73527#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:38,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {73528#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73528#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:38,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {73528#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:38,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {73529#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73529#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:38,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {73529#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:38,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {73530#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73530#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:38,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {73530#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:38,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {73531#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73531#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:38,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {73531#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:38,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {73532#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73532#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:38,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {73532#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:38,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {73533#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73533#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:38,715 INFO L290 TraceCheckUtils]: 85: Hoare triple {73533#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:38,715 INFO L290 TraceCheckUtils]: 86: Hoare triple {73534#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73534#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:38,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {73534#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:38,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {73535#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73535#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:38,716 INFO L290 TraceCheckUtils]: 89: Hoare triple {73535#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:38,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {73536#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73536#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:38,717 INFO L290 TraceCheckUtils]: 91: Hoare triple {73536#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:38,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {73537#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73537#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:38,718 INFO L290 TraceCheckUtils]: 93: Hoare triple {73537#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:38,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {73538#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73538#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:38,719 INFO L290 TraceCheckUtils]: 95: Hoare triple {73538#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:38,719 INFO L290 TraceCheckUtils]: 96: Hoare triple {73539#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73539#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:38,720 INFO L290 TraceCheckUtils]: 97: Hoare triple {73539#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:38,720 INFO L290 TraceCheckUtils]: 98: Hoare triple {73540#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73540#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:38,720 INFO L290 TraceCheckUtils]: 99: Hoare triple {73540#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:38,721 INFO L290 TraceCheckUtils]: 100: Hoare triple {73541#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73541#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:38,721 INFO L290 TraceCheckUtils]: 101: Hoare triple {73541#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:38,721 INFO L290 TraceCheckUtils]: 102: Hoare triple {73542#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73542#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:38,722 INFO L290 TraceCheckUtils]: 103: Hoare triple {73542#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:38,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {73543#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73543#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:38,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {73543#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:38,723 INFO L290 TraceCheckUtils]: 106: Hoare triple {73544#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73544#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:38,723 INFO L290 TraceCheckUtils]: 107: Hoare triple {73544#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:38,723 INFO L290 TraceCheckUtils]: 108: Hoare triple {73545#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73545#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:38,724 INFO L290 TraceCheckUtils]: 109: Hoare triple {73545#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73546#(<= main_~i~0 52)} is VALID [2022-04-15 06:01:38,724 INFO L290 TraceCheckUtils]: 110: Hoare triple {73546#(<= main_~i~0 52)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 06:01:38,724 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 06:01:38,724 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 06:01:38,725 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 06:01:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:38,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:42,696 INFO L290 TraceCheckUtils]: 123: Hoare triple {73490#false} assume !false; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 122: Hoare triple {73490#false} assume 0 == ~cond; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 121: Hoare triple {73490#false} ~cond := #in~cond; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L272 TraceCheckUtils]: 120: Hoare triple {73490#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 119: Hoare triple {73490#false} assume !(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 118: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 117: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 116: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 115: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 114: Hoare triple {73490#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {73490#false} is VALID [2022-04-15 06:01:42,697 INFO L290 TraceCheckUtils]: 113: Hoare triple {73490#false} assume !!(0 != #t~mem4);havoc #t~mem4; {73490#false} is VALID [2022-04-15 06:01:42,698 INFO L290 TraceCheckUtils]: 112: Hoare triple {73490#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {73490#false} is VALID [2022-04-15 06:01:42,698 INFO L290 TraceCheckUtils]: 111: Hoare triple {73490#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {73490#false} is VALID [2022-04-15 06:01:42,698 INFO L290 TraceCheckUtils]: 110: Hoare triple {73960#(< main_~i~0 1023)} assume !(~i~0 < 1023); {73490#false} is VALID [2022-04-15 06:01:42,698 INFO L290 TraceCheckUtils]: 109: Hoare triple {73964#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73960#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:42,699 INFO L290 TraceCheckUtils]: 108: Hoare triple {73964#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73964#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:42,699 INFO L290 TraceCheckUtils]: 107: Hoare triple {73971#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73964#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:42,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {73971#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73971#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:42,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {73978#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73971#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:42,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {73978#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73978#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:42,701 INFO L290 TraceCheckUtils]: 103: Hoare triple {73985#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73978#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:42,701 INFO L290 TraceCheckUtils]: 102: Hoare triple {73985#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73985#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:42,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {73992#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73985#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:42,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {73992#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73992#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:42,702 INFO L290 TraceCheckUtils]: 99: Hoare triple {73999#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73992#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:42,703 INFO L290 TraceCheckUtils]: 98: Hoare triple {73999#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73999#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:42,703 INFO L290 TraceCheckUtils]: 97: Hoare triple {74006#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73999#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:42,703 INFO L290 TraceCheckUtils]: 96: Hoare triple {74006#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74006#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:42,704 INFO L290 TraceCheckUtils]: 95: Hoare triple {74013#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74006#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:42,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {74013#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74013#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:42,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {74020#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74013#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:42,705 INFO L290 TraceCheckUtils]: 92: Hoare triple {74020#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74020#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:42,705 INFO L290 TraceCheckUtils]: 91: Hoare triple {74027#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74020#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:42,706 INFO L290 TraceCheckUtils]: 90: Hoare triple {74027#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74027#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:42,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {74034#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74027#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:42,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {74034#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74034#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:42,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {74041#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74034#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:42,707 INFO L290 TraceCheckUtils]: 86: Hoare triple {74041#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74041#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:42,708 INFO L290 TraceCheckUtils]: 85: Hoare triple {74048#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74041#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:42,708 INFO L290 TraceCheckUtils]: 84: Hoare triple {74048#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74048#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:42,709 INFO L290 TraceCheckUtils]: 83: Hoare triple {74055#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74048#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:42,709 INFO L290 TraceCheckUtils]: 82: Hoare triple {74055#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74055#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:42,709 INFO L290 TraceCheckUtils]: 81: Hoare triple {74062#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74055#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:42,710 INFO L290 TraceCheckUtils]: 80: Hoare triple {74062#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74062#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:42,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {74069#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74062#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:42,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {74069#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74069#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:42,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {74076#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74069#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:42,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {74076#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74076#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:42,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {74083#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74076#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:42,712 INFO L290 TraceCheckUtils]: 74: Hoare triple {74083#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74083#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:42,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {74090#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74083#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:42,713 INFO L290 TraceCheckUtils]: 72: Hoare triple {74090#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74090#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:42,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {74097#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74090#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:42,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {74097#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74097#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:42,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {74104#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74097#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:42,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {74104#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74104#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:42,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {74111#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74104#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:42,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {74111#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74111#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:42,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {74118#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74111#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:42,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {74118#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74118#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:42,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {74125#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74118#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:42,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {74125#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74125#(< main_~i~0 999)} is VALID [2022-04-15 06:01:42,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {74132#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74125#(< main_~i~0 999)} is VALID [2022-04-15 06:01:42,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {74132#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74132#(< main_~i~0 998)} is VALID [2022-04-15 06:01:42,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {74139#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74132#(< main_~i~0 998)} is VALID [2022-04-15 06:01:42,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {74139#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74139#(< main_~i~0 997)} is VALID [2022-04-15 06:01:42,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {74146#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74139#(< main_~i~0 997)} is VALID [2022-04-15 06:01:42,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {74146#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74146#(< main_~i~0 996)} is VALID [2022-04-15 06:01:42,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {74153#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74146#(< main_~i~0 996)} is VALID [2022-04-15 06:01:42,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {74153#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74153#(< main_~i~0 995)} is VALID [2022-04-15 06:01:42,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {74160#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74153#(< main_~i~0 995)} is VALID [2022-04-15 06:01:42,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {74160#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74160#(< main_~i~0 994)} is VALID [2022-04-15 06:01:42,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {74167#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74160#(< main_~i~0 994)} is VALID [2022-04-15 06:01:42,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {74167#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74167#(< main_~i~0 993)} is VALID [2022-04-15 06:01:42,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {74174#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74167#(< main_~i~0 993)} is VALID [2022-04-15 06:01:42,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {74174#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74174#(< main_~i~0 992)} is VALID [2022-04-15 06:01:42,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {74181#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74174#(< main_~i~0 992)} is VALID [2022-04-15 06:01:42,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {74181#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74181#(< main_~i~0 991)} is VALID [2022-04-15 06:01:42,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {74188#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74181#(< main_~i~0 991)} is VALID [2022-04-15 06:01:42,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {74188#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74188#(< main_~i~0 990)} is VALID [2022-04-15 06:01:42,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {74195#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74188#(< main_~i~0 990)} is VALID [2022-04-15 06:01:42,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {74195#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74195#(< main_~i~0 989)} is VALID [2022-04-15 06:01:42,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {74202#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74195#(< main_~i~0 989)} is VALID [2022-04-15 06:01:42,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {74202#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74202#(< main_~i~0 988)} is VALID [2022-04-15 06:01:42,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {74209#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74202#(< main_~i~0 988)} is VALID [2022-04-15 06:01:42,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {74209#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74209#(< main_~i~0 987)} is VALID [2022-04-15 06:01:42,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {74216#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74209#(< main_~i~0 987)} is VALID [2022-04-15 06:01:42,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {74216#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74216#(< main_~i~0 986)} is VALID [2022-04-15 06:01:42,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {74223#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74216#(< main_~i~0 986)} is VALID [2022-04-15 06:01:42,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {74223#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74223#(< main_~i~0 985)} is VALID [2022-04-15 06:01:42,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {74230#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74223#(< main_~i~0 985)} is VALID [2022-04-15 06:01:42,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {74230#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74230#(< main_~i~0 984)} is VALID [2022-04-15 06:01:42,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {74237#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74230#(< main_~i~0 984)} is VALID [2022-04-15 06:01:42,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {74237#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74237#(< main_~i~0 983)} is VALID [2022-04-15 06:01:42,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {74244#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74237#(< main_~i~0 983)} is VALID [2022-04-15 06:01:42,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {74244#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74244#(< main_~i~0 982)} is VALID [2022-04-15 06:01:42,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {74251#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74244#(< main_~i~0 982)} is VALID [2022-04-15 06:01:42,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {74251#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74251#(< main_~i~0 981)} is VALID [2022-04-15 06:01:42,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {74258#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74251#(< main_~i~0 981)} is VALID [2022-04-15 06:01:42,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {74258#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74258#(< main_~i~0 980)} is VALID [2022-04-15 06:01:42,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {74265#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74258#(< main_~i~0 980)} is VALID [2022-04-15 06:01:42,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {74265#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74265#(< main_~i~0 979)} is VALID [2022-04-15 06:01:42,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {74272#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74265#(< main_~i~0 979)} is VALID [2022-04-15 06:01:42,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {74272#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74272#(< main_~i~0 978)} is VALID [2022-04-15 06:01:42,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {74279#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74272#(< main_~i~0 978)} is VALID [2022-04-15 06:01:42,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {74279#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74279#(< main_~i~0 977)} is VALID [2022-04-15 06:01:42,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {74286#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74279#(< main_~i~0 977)} is VALID [2022-04-15 06:01:42,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {74286#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74286#(< main_~i~0 976)} is VALID [2022-04-15 06:01:42,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {74293#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74286#(< main_~i~0 976)} is VALID [2022-04-15 06:01:42,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {74293#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74293#(< main_~i~0 975)} is VALID [2022-04-15 06:01:42,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {74300#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74293#(< main_~i~0 975)} is VALID [2022-04-15 06:01:42,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {74300#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74300#(< main_~i~0 974)} is VALID [2022-04-15 06:01:42,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {74307#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74300#(< main_~i~0 974)} is VALID [2022-04-15 06:01:42,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {74307#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74307#(< main_~i~0 973)} is VALID [2022-04-15 06:01:42,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {74314#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74307#(< main_~i~0 973)} is VALID [2022-04-15 06:01:42,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {74314#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74314#(< main_~i~0 972)} is VALID [2022-04-15 06:01:42,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {74321#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {74314#(< main_~i~0 972)} is VALID [2022-04-15 06:01:42,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {74321#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {74321#(< main_~i~0 971)} is VALID [2022-04-15 06:01:42,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {73489#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {74321#(< main_~i~0 971)} is VALID [2022-04-15 06:01:42,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {73489#true} call #t~ret5 := main(); {73489#true} is VALID [2022-04-15 06:01:42,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73489#true} {73489#true} #58#return; {73489#true} is VALID [2022-04-15 06:01:42,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {73489#true} assume true; {73489#true} is VALID [2022-04-15 06:01:42,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {73489#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(10, 2); {73489#true} is VALID [2022-04-15 06:01:42,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {73489#true} call ULTIMATE.init(); {73489#true} is VALID [2022-04-15 06:01:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577031520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:42,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:42,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 06:01:42,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323961545] [2022-04-15 06:01:42,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323961545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:42,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:42,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:01:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547096957] [2022-04-15 06:01:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 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 124 [2022-04-15 06:01:42,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:42,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have 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:42,833 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:01:42,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:01:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:01:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:01:42,835 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have 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,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:54,946 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2022-04-15 06:01:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:01:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 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 124 [2022-04-15 06:01:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have 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,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 395 transitions. [2022-04-15 06:01:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have 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,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 395 transitions. [2022-04-15 06:01:54,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 395 transitions. [2022-04-15 06:01:55,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:55,296 INFO L225 Difference]: With dead ends: 347 [2022-04-15 06:01:55,296 INFO L226 Difference]: Without dead ends: 333 [2022-04-15 06:01:55,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 06:01:55,298 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 876 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:55,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [876 Valid, 41 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:01:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-15 06:01:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 127. [2022-04-15 06:01:56,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:56,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:56,355 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:56,355 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:56,379 INFO L93 Difference]: Finished difference Result 333 states and 385 transitions. [2022-04-15 06:01:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2022-04-15 06:01:56,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:56,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:56,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 333 states. [2022-04-15 06:01:56,381 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 333 states. [2022-04-15 06:01:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:56,387 INFO L93 Difference]: Finished difference Result 333 states and 385 transitions. [2022-04-15 06:01:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2022-04-15 06:01:56,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:56,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:56,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:56,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 06:01:56,404 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2022-04-15 06:01:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:56,404 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 06:01:56,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have 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:56,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 06:01:56,759 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:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 06:01:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 06:01:56,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:56,760 INFO L499 BasicCegarLoop]: trace histogram [53, 53, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:56,788 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:01:56,976 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:01:56,976 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1397357113, now seen corresponding path program 107 times [2022-04-15 06:01:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432619902] [2022-04-15 06:01:56,988 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:56,988 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:56,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1397357113, now seen corresponding path program 108 times [2022-04-15 06:01:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:56,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771115459] [2022-04-15 06:01:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:58,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {76124#(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(10, 2); {76065#true} is VALID [2022-04-15 06:01:58,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 06:01:58,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 06:01:58,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:58,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {76124#(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(10, 2); {76065#true} is VALID [2022-04-15 06:01:58,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 06:01:58,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 06:01:58,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 06:01:58,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76070#(= main_~i~0 0)} is VALID [2022-04-15 06:01:58,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {76070#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76070#(= main_~i~0 0)} is VALID [2022-04-15 06:01:58,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {76070#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:58,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {76071#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:58,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {76071#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:58,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {76072#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:58,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {76072#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76073#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:58,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {76073#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76073#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:58,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {76073#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76074#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:58,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {76074#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76074#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:58,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {76074#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76075#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:58,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {76075#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76075#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:58,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {76075#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76076#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:58,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {76076#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76076#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:58,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {76076#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76077#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:58,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {76077#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76077#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:58,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {76077#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76078#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:58,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {76078#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76078#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:58,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {76078#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76079#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:58,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {76079#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76079#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:58,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {76079#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76080#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:58,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {76080#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76080#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:58,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {76080#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76081#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:58,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {76081#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76081#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:58,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {76081#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76082#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:58,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {76082#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76082#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:58,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {76082#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76083#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:58,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {76083#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76083#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:58,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {76083#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76084#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:58,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {76084#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76084#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:58,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {76084#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76085#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:58,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {76085#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76085#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:58,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {76085#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76086#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:58,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {76086#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76086#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:58,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {76086#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76087#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:58,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {76087#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76087#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:58,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {76087#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76088#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:58,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {76088#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76088#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:58,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {76088#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76089#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:58,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {76089#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76089#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:58,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {76089#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76090#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:58,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {76090#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76090#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:58,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {76090#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76091#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:58,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {76091#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76091#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:58,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {76091#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76092#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:58,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {76092#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76092#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:58,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {76092#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76093#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:58,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {76093#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76093#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:58,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {76093#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76094#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:58,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {76094#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76094#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:58,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {76094#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76095#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:58,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {76095#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76095#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:58,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {76095#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76096#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:58,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {76096#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76096#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:58,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {76096#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76097#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:58,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {76097#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76097#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:58,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {76097#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76098#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:58,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {76098#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76098#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:58,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {76098#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76099#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:58,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {76099#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76099#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:58,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {76099#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76100#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:58,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {76100#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76100#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:58,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {76100#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76101#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:58,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {76101#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76101#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:58,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {76101#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76102#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:58,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {76102#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76102#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:58,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {76102#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76103#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:58,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {76103#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76103#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:58,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {76103#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76104#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:58,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {76104#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76104#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:58,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {76104#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76105#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:58,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {76105#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76105#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:58,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {76105#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76106#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:58,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {76106#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76106#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:58,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {76106#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76107#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:58,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {76107#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76107#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:58,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {76107#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76108#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:58,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {76108#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76108#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:58,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {76108#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76109#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:58,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {76109#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76109#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:58,417 INFO L290 TraceCheckUtils]: 85: Hoare triple {76109#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76110#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:58,418 INFO L290 TraceCheckUtils]: 86: Hoare triple {76110#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76110#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:58,418 INFO L290 TraceCheckUtils]: 87: Hoare triple {76110#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76111#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:58,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {76111#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76111#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:58,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {76111#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76112#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:58,419 INFO L290 TraceCheckUtils]: 90: Hoare triple {76112#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76112#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:58,420 INFO L290 TraceCheckUtils]: 91: Hoare triple {76112#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76113#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:58,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {76113#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76113#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:58,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {76113#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76114#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:58,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {76114#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76114#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:58,421 INFO L290 TraceCheckUtils]: 95: Hoare triple {76114#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76115#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:58,422 INFO L290 TraceCheckUtils]: 96: Hoare triple {76115#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76115#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:58,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {76115#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76116#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:58,422 INFO L290 TraceCheckUtils]: 98: Hoare triple {76116#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76116#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:58,423 INFO L290 TraceCheckUtils]: 99: Hoare triple {76116#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76117#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:58,423 INFO L290 TraceCheckUtils]: 100: Hoare triple {76117#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76117#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:58,424 INFO L290 TraceCheckUtils]: 101: Hoare triple {76117#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76118#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:58,424 INFO L290 TraceCheckUtils]: 102: Hoare triple {76118#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76118#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:58,425 INFO L290 TraceCheckUtils]: 103: Hoare triple {76118#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76119#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:58,425 INFO L290 TraceCheckUtils]: 104: Hoare triple {76119#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76119#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:58,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {76119#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76120#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:58,426 INFO L290 TraceCheckUtils]: 106: Hoare triple {76120#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76120#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:58,426 INFO L290 TraceCheckUtils]: 107: Hoare triple {76120#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76121#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:58,426 INFO L290 TraceCheckUtils]: 108: Hoare triple {76121#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76121#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:58,427 INFO L290 TraceCheckUtils]: 109: Hoare triple {76121#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76122#(<= main_~i~0 52)} is VALID [2022-04-15 06:01:58,427 INFO L290 TraceCheckUtils]: 110: Hoare triple {76122#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76122#(<= main_~i~0 52)} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 111: Hoare triple {76122#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76123#(<= main_~i~0 53)} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 112: Hoare triple {76123#(<= main_~i~0 53)} assume !(~i~0 < 1023); {76066#false} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 113: Hoare triple {76066#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76066#false} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 114: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 115: Hoare triple {76066#false} assume !!(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 06:01:58,428 INFO L290 TraceCheckUtils]: 116: Hoare triple {76066#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 117: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 118: Hoare triple {76066#false} assume !!(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 119: Hoare triple {76066#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 120: Hoare triple {76066#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 121: Hoare triple {76066#false} assume !(0 != #t~mem4);havoc #t~mem4; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L272 TraceCheckUtils]: 122: Hoare triple {76066#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 123: Hoare triple {76066#false} ~cond := #in~cond; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 124: Hoare triple {76066#false} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 06:01:58,429 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 06:01:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:01:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771115459] [2022-04-15 06:01:58,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771115459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894609806] [2022-04-15 06:01:58,431 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:58,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:58,432 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:01:58,433 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:01:58,810 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:01:58,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:58,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:01:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:58,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:59,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76065#true} is VALID [2022-04-15 06:01:59,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#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(10, 2); {76065#true} is VALID [2022-04-15 06:01:59,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 06:01:59,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 83: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 84: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 85: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 86: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 93: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,174 INFO L290 TraceCheckUtils]: 94: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 95: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 102: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 103: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 106: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 107: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 108: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 109: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 110: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 111: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,176 INFO L290 TraceCheckUtils]: 112: Hoare triple {76065#true} assume !(~i~0 < 1023); {76065#true} is VALID [2022-04-15 06:01:59,177 INFO L290 TraceCheckUtils]: 113: Hoare triple {76065#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76467#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:59,177 INFO L290 TraceCheckUtils]: 114: Hoare triple {76467#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76467#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:59,177 INFO L290 TraceCheckUtils]: 115: Hoare triple {76467#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {76467#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:59,178 INFO L290 TraceCheckUtils]: 116: Hoare triple {76467#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:59,178 INFO L290 TraceCheckUtils]: 117: Hoare triple {76071#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76071#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:59,178 INFO L290 TraceCheckUtils]: 118: Hoare triple {76071#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {76071#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:59,179 INFO L290 TraceCheckUtils]: 119: Hoare triple {76071#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:59,179 INFO L290 TraceCheckUtils]: 120: Hoare triple {76072#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76072#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:59,180 INFO L290 TraceCheckUtils]: 121: Hoare triple {76072#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {76072#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:59,180 INFO L272 TraceCheckUtils]: 122: Hoare triple {76072#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:59,181 INFO L290 TraceCheckUtils]: 123: Hoare triple {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:59,181 INFO L290 TraceCheckUtils]: 124: Hoare triple {76499#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 06:01:59,181 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 06:01:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 06:01:59,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:59,585 INFO L290 TraceCheckUtils]: 125: Hoare triple {76066#false} assume !false; {76066#false} is VALID [2022-04-15 06:01:59,586 INFO L290 TraceCheckUtils]: 124: Hoare triple {76499#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76066#false} is VALID [2022-04-15 06:01:59,586 INFO L290 TraceCheckUtils]: 123: Hoare triple {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:59,587 INFO L272 TraceCheckUtils]: 122: Hoare triple {76515#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {76495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:59,587 INFO L290 TraceCheckUtils]: 121: Hoare triple {76515#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:59,587 INFO L290 TraceCheckUtils]: 120: Hoare triple {76515#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:59,588 INFO L290 TraceCheckUtils]: 119: Hoare triple {76525#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76515#(<= main_~i~0 1024)} is VALID [2022-04-15 06:01:59,588 INFO L290 TraceCheckUtils]: 118: Hoare triple {76525#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:59,589 INFO L290 TraceCheckUtils]: 117: Hoare triple {76525#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:59,589 INFO L290 TraceCheckUtils]: 116: Hoare triple {76535#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {76525#(<= main_~i~0 1023)} is VALID [2022-04-15 06:01:59,589 INFO L290 TraceCheckUtils]: 115: Hoare triple {76535#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:59,590 INFO L290 TraceCheckUtils]: 114: Hoare triple {76535#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:59,590 INFO L290 TraceCheckUtils]: 113: Hoare triple {76065#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {76535#(<= main_~i~0 1022)} is VALID [2022-04-15 06:01:59,590 INFO L290 TraceCheckUtils]: 112: Hoare triple {76065#true} assume !(~i~0 < 1023); {76065#true} is VALID [2022-04-15 06:01:59,590 INFO L290 TraceCheckUtils]: 111: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 109: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 108: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 107: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 102: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 101: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 100: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,591 INFO L290 TraceCheckUtils]: 99: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 98: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 97: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 96: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 95: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 94: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 88: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 82: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 79: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 75: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {76065#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {76065#true} is VALID [2022-04-15 06:01:59,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {76065#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {76065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {76065#true} call #t~ret5 := main(); {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76065#true} {76065#true} #58#return; {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {76065#true} assume true; {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {76065#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(10, 2); {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {76065#true} call ULTIMATE.init(); {76065#true} is VALID [2022-04-15 06:01:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 06:01:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894609806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:59,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 63 [2022-04-15 06:01:59,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:59,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432619902] [2022-04-15 06:01:59,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432619902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:59,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:59,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:01:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703587470] [2022-04-15 06:01:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 06:01:59,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:59,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have 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:59,696 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:01:59,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:01:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:01:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2130, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:01:59,698 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have 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:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:11,734 INFO L93 Difference]: Finished difference Result 353 states and 407 transitions. [2022-04-15 06:02:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:02:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 06:02:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have 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:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 402 transitions. [2022-04-15 06:02:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have 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:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 402 transitions. [2022-04-15 06:02:11,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 402 transitions. [2022-04-15 06:02:12,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:12,095 INFO L225 Difference]: With dead ends: 353 [2022-04-15 06:02:12,095 INFO L226 Difference]: Without dead ends: 339 [2022-04-15 06:02:12,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5017, Invalid=8555, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:02:12,097 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 840 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:12,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 31 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:02:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-15 06:02:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 129. [2022-04-15 06:02:13,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:13,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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:02:13,195 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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:02:13,196 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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:02:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:13,202 INFO L93 Difference]: Finished difference Result 339 states and 392 transitions. [2022-04-15 06:02:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2022-04-15 06:02:13,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:13,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:13,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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 339 states. [2022-04-15 06:02:13,203 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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 339 states. [2022-04-15 06:02:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:13,209 INFO L93 Difference]: Finished difference Result 339 states and 392 transitions. [2022-04-15 06:02:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2022-04-15 06:02:13,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:13,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:13,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:13,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 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:02:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-15 06:02:13,212 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2022-04-15 06:02:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:13,212 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-15 06:02:13,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have 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:13,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-15 06:02:13,627 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:02:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 06:02:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 06:02:13,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:13,628 INFO L499 BasicCegarLoop]: trace histogram [54, 54, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:13,656 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:13,842 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:13,842 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1068043995, now seen corresponding path program 109 times [2022-04-15 06:02:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569831841] [2022-04-15 06:02:13,851 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:13,852 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:13,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1068043995, now seen corresponding path program 110 times [2022-04-15 06:02:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153728988] [2022-04-15 06:02:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:15,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {78696#(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(10, 2); {78636#true} is VALID [2022-04-15 06:02:15,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 06:02:15,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 06:02:15,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:15,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {78696#(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(10, 2); {78636#true} is VALID [2022-04-15 06:02:15,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 06:02:15,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 06:02:15,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 06:02:15,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78641#(= main_~i~0 0)} is VALID [2022-04-15 06:02:15,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {78641#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78641#(= main_~i~0 0)} is VALID [2022-04-15 06:02:15,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {78641#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:15,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {78642#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:15,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {78642#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:15,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {78643#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:15,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {78643#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:15,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {78644#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:15,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {78644#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:15,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {78645#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 06:02:15,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {78645#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:15,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {78646#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:15,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {78646#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:15,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {78647#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:15,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {78647#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:15,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {78648#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:15,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {78648#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:15,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {78649#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:15,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {78649#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:15,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {78650#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:15,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {78650#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:15,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {78651#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:15,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {78651#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:15,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {78652#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 06:02:15,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {78652#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:15,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {78653#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:15,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {78653#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:15,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {78654#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:15,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {78654#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:15,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {78655#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:15,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {78655#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:15,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {78656#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:15,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {78656#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:15,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {78657#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:15,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {78657#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:15,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {78658#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:15,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {78658#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:15,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {78659#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 06:02:15,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {78659#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:15,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {78660#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:15,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {78660#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:15,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {78661#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:15,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {78661#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:15,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {78662#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:15,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {78662#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:15,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {78663#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:15,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {78663#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:15,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {78664#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:15,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {78664#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:15,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {78665#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:15,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {78665#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:15,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {78666#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -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 25)} is VALID [2022-04-15 06:02:15,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {78666#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:15,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {78667#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:15,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {78667#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:15,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {78668#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:15,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {78668#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:15,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {78669#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:15,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {78669#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:15,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {78670#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:15,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {78670#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:15,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {78671#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:15,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {78671#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:15,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {78672#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:15,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {78672#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:15,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {78673#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -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 32)} is VALID [2022-04-15 06:02:15,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {78673#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:15,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {78674#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:15,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {78674#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:15,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {78675#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:15,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {78675#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:15,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {78676#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:15,930 INFO L290 TraceCheckUtils]: 77: Hoare triple {78676#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:15,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {78677#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:15,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {78677#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:15,931 INFO L290 TraceCheckUtils]: 80: Hoare triple {78678#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:15,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {78678#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:15,932 INFO L290 TraceCheckUtils]: 82: Hoare triple {78679#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:15,932 INFO L290 TraceCheckUtils]: 83: Hoare triple {78679#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:15,932 INFO L290 TraceCheckUtils]: 84: Hoare triple {78680#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -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 39)} is VALID [2022-04-15 06:02:15,933 INFO L290 TraceCheckUtils]: 85: Hoare triple {78680#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:15,933 INFO L290 TraceCheckUtils]: 86: Hoare triple {78681#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:15,934 INFO L290 TraceCheckUtils]: 87: Hoare triple {78681#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:15,934 INFO L290 TraceCheckUtils]: 88: Hoare triple {78682#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:15,934 INFO L290 TraceCheckUtils]: 89: Hoare triple {78682#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:15,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {78683#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:15,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {78683#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:15,936 INFO L290 TraceCheckUtils]: 92: Hoare triple {78684#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:15,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {78684#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:15,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {78685#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:15,937 INFO L290 TraceCheckUtils]: 95: Hoare triple {78685#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:15,937 INFO L290 TraceCheckUtils]: 96: Hoare triple {78686#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:15,938 INFO L290 TraceCheckUtils]: 97: Hoare triple {78686#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:15,938 INFO L290 TraceCheckUtils]: 98: Hoare triple {78687#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -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 46)} is VALID [2022-04-15 06:02:15,938 INFO L290 TraceCheckUtils]: 99: Hoare triple {78687#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:15,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {78688#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:15,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {78688#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:15,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {78689#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:15,940 INFO L290 TraceCheckUtils]: 103: Hoare triple {78689#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:15,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {78690#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:15,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {78690#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:15,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {78691#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:15,942 INFO L290 TraceCheckUtils]: 107: Hoare triple {78691#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:15,942 INFO L290 TraceCheckUtils]: 108: Hoare triple {78692#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:15,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {78692#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:15,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {78693#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:15,943 INFO L290 TraceCheckUtils]: 111: Hoare triple {78693#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:15,943 INFO L290 TraceCheckUtils]: 112: Hoare triple {78694#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -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 53)} is VALID [2022-04-15 06:02:15,944 INFO L290 TraceCheckUtils]: 113: Hoare triple {78694#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78695#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:15,944 INFO L290 TraceCheckUtils]: 114: Hoare triple {78695#(<= main_~i~0 54)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 06:02:15,944 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 06:02:15,945 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 06:02:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:15,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153728988] [2022-04-15 06:02:15,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153728988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:15,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351738643] [2022-04-15 06:02:15,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:15,952 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:15,983 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:16,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:16,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 06:02:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:16,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:17,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78636#true} is VALID [2022-04-15 06:02:17,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#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(10, 2); {78636#true} is VALID [2022-04-15 06:02:17,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 06:02:17,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 06:02:17,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 06:02:17,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78715#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:17,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {78715#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 06:02:17,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {78715#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:17,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {78642#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78642#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:17,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {78642#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:17,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {78643#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78643#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:17,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {78643#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:17,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {78644#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78644#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:17,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {78644#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:17,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {78645#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 06:02:17,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {78645#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:17,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {78646#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78646#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:17,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {78646#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:17,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {78647#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78647#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:17,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {78647#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:17,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {78648#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78648#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:17,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {78648#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:17,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {78649#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78649#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:17,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {78649#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:17,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {78650#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78650#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:17,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {78650#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:17,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {78651#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78651#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:17,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {78651#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:17,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {78652#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 06:02:17,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {78652#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:17,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {78653#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78653#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:17,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {78653#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:17,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {78654#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78654#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:17,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {78654#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:17,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {78655#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78655#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:17,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {78655#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:17,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {78656#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78656#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:17,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {78656#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:17,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {78657#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78657#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:17,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {78657#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:17,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {78658#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78658#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:17,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {78658#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:17,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {78659#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 06:02:17,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {78659#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:17,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {78660#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78660#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:17,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {78660#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:17,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {78661#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78661#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:17,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {78661#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:17,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {78662#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78662#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:17,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {78662#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:17,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {78663#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78663#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:17,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {78663#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:17,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {78664#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78664#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:17,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {78664#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:17,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {78665#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78665#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:17,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {78665#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:17,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {78666#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -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 25)} is VALID [2022-04-15 06:02:17,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {78666#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:17,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {78667#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78667#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:17,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {78667#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:17,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {78668#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78668#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:17,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {78668#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:17,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {78669#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78669#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:17,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {78669#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:17,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {78670#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78670#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:17,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {78670#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:17,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {78671#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78671#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:17,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {78671#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:17,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {78672#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78672#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:17,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {78672#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:17,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {78673#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -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 32)} is VALID [2022-04-15 06:02:17,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {78673#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:17,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {78674#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78674#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:17,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {78674#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:17,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {78675#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78675#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:17,452 INFO L290 TraceCheckUtils]: 75: Hoare triple {78675#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:17,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {78676#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78676#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:17,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {78676#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:17,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {78677#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78677#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:17,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {78677#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:17,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {78678#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78678#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:17,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {78678#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:17,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {78679#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78679#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:17,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {78679#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:17,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {78680#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -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 39)} is VALID [2022-04-15 06:02:17,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {78680#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:17,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {78681#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78681#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:17,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {78681#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:17,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {78682#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78682#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:17,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {78682#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:17,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {78683#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78683#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:17,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {78683#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:17,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {78684#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78684#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:17,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {78684#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:17,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {78685#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78685#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:17,459 INFO L290 TraceCheckUtils]: 95: Hoare triple {78685#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:17,459 INFO L290 TraceCheckUtils]: 96: Hoare triple {78686#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78686#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:17,459 INFO L290 TraceCheckUtils]: 97: Hoare triple {78686#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:17,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {78687#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -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 46)} is VALID [2022-04-15 06:02:17,460 INFO L290 TraceCheckUtils]: 99: Hoare triple {78687#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:17,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {78688#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78688#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:17,461 INFO L290 TraceCheckUtils]: 101: Hoare triple {78688#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:17,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {78689#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78689#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:17,462 INFO L290 TraceCheckUtils]: 103: Hoare triple {78689#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:17,462 INFO L290 TraceCheckUtils]: 104: Hoare triple {78690#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78690#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:17,462 INFO L290 TraceCheckUtils]: 105: Hoare triple {78690#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:17,463 INFO L290 TraceCheckUtils]: 106: Hoare triple {78691#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78691#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:17,463 INFO L290 TraceCheckUtils]: 107: Hoare triple {78691#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:17,463 INFO L290 TraceCheckUtils]: 108: Hoare triple {78692#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78692#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:17,464 INFO L290 TraceCheckUtils]: 109: Hoare triple {78692#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:17,464 INFO L290 TraceCheckUtils]: 110: Hoare triple {78693#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78693#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:17,464 INFO L290 TraceCheckUtils]: 111: Hoare triple {78693#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:17,465 INFO L290 TraceCheckUtils]: 112: Hoare triple {78694#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -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 53)} is VALID [2022-04-15 06:02:17,465 INFO L290 TraceCheckUtils]: 113: Hoare triple {78694#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78695#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 114: Hoare triple {78695#(<= main_~i~0 54)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:17,466 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:17,467 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 06:02:17,467 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 06:02:17,467 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 06:02:17,467 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 06:02:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:17,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:21,567 INFO L290 TraceCheckUtils]: 127: Hoare triple {78637#false} assume !false; {78637#false} is VALID [2022-04-15 06:02:21,567 INFO L290 TraceCheckUtils]: 126: Hoare triple {78637#false} assume 0 == ~cond; {78637#false} is VALID [2022-04-15 06:02:21,567 INFO L290 TraceCheckUtils]: 125: Hoare triple {78637#false} ~cond := #in~cond; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L272 TraceCheckUtils]: 124: Hoare triple {78637#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 123: Hoare triple {78637#false} assume !(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 122: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 121: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 120: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 119: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 118: Hoare triple {78637#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 117: Hoare triple {78637#false} assume !!(0 != #t~mem4);havoc #t~mem4; {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 116: Hoare triple {78637#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {78637#false} is VALID [2022-04-15 06:02:21,568 INFO L290 TraceCheckUtils]: 115: Hoare triple {78637#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {78637#false} is VALID [2022-04-15 06:02:21,569 INFO L290 TraceCheckUtils]: 114: Hoare triple {79121#(< main_~i~0 1023)} assume !(~i~0 < 1023); {78637#false} is VALID [2022-04-15 06:02:21,569 INFO L290 TraceCheckUtils]: 113: Hoare triple {79125#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79121#(< main_~i~0 1023)} is VALID [2022-04-15 06:02:21,570 INFO L290 TraceCheckUtils]: 112: Hoare triple {79125#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79125#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:21,570 INFO L290 TraceCheckUtils]: 111: Hoare triple {79132#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79125#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:21,570 INFO L290 TraceCheckUtils]: 110: Hoare triple {79132#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79132#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:21,571 INFO L290 TraceCheckUtils]: 109: Hoare triple {79139#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79132#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:21,571 INFO L290 TraceCheckUtils]: 108: Hoare triple {79139#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79139#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:21,572 INFO L290 TraceCheckUtils]: 107: Hoare triple {79146#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79139#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:21,572 INFO L290 TraceCheckUtils]: 106: Hoare triple {79146#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79146#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:21,572 INFO L290 TraceCheckUtils]: 105: Hoare triple {79153#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79146#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:21,573 INFO L290 TraceCheckUtils]: 104: Hoare triple {79153#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79153#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:21,573 INFO L290 TraceCheckUtils]: 103: Hoare triple {79160#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79153#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:21,573 INFO L290 TraceCheckUtils]: 102: Hoare triple {79160#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79160#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:21,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {79167#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79160#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:21,574 INFO L290 TraceCheckUtils]: 100: Hoare triple {79167#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79167#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:21,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {79174#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79167#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:21,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {79174#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79174#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:21,575 INFO L290 TraceCheckUtils]: 97: Hoare triple {79181#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79174#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:21,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {79181#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79181#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:21,576 INFO L290 TraceCheckUtils]: 95: Hoare triple {79188#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79181#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:21,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {79188#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79188#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:21,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {79195#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79188#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:21,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {79195#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79195#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:21,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {79202#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79195#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:21,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {79202#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79202#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:21,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {79209#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79202#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:21,579 INFO L290 TraceCheckUtils]: 88: Hoare triple {79209#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79209#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:21,580 INFO L290 TraceCheckUtils]: 87: Hoare triple {79216#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79209#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:21,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {79216#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79216#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:21,580 INFO L290 TraceCheckUtils]: 85: Hoare triple {79223#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79216#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:21,581 INFO L290 TraceCheckUtils]: 84: Hoare triple {79223#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79223#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:21,581 INFO L290 TraceCheckUtils]: 83: Hoare triple {79230#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79223#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:21,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {79230#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79230#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:21,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {79237#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79230#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:21,582 INFO L290 TraceCheckUtils]: 80: Hoare triple {79237#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79237#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:21,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {79244#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79237#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:21,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {79244#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79244#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:21,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {79251#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79244#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:21,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {79251#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79251#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:21,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {79258#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79251#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:21,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {79258#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79258#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:21,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {79265#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79258#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:21,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {79265#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79265#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:21,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {79272#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79265#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:21,587 INFO L290 TraceCheckUtils]: 70: Hoare triple {79272#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79272#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:21,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {79279#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79272#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:21,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {79279#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79279#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:21,588 INFO L290 TraceCheckUtils]: 67: Hoare triple {79286#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79279#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:21,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {79286#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79286#(< main_~i~0 999)} is VALID [2022-04-15 06:02:21,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {79293#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79286#(< main_~i~0 999)} is VALID [2022-04-15 06:02:21,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {79293#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79293#(< main_~i~0 998)} is VALID [2022-04-15 06:02:21,590 INFO L290 TraceCheckUtils]: 63: Hoare triple {79300#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79293#(< main_~i~0 998)} is VALID [2022-04-15 06:02:21,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {79300#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79300#(< main_~i~0 997)} is VALID [2022-04-15 06:02:21,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {79307#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79300#(< main_~i~0 997)} is VALID [2022-04-15 06:02:21,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {79307#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79307#(< main_~i~0 996)} is VALID [2022-04-15 06:02:21,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {79314#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79307#(< main_~i~0 996)} is VALID [2022-04-15 06:02:21,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {79314#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79314#(< main_~i~0 995)} is VALID [2022-04-15 06:02:21,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {79321#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79314#(< main_~i~0 995)} is VALID [2022-04-15 06:02:21,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {79321#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79321#(< main_~i~0 994)} is VALID [2022-04-15 06:02:21,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {79328#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79321#(< main_~i~0 994)} is VALID [2022-04-15 06:02:21,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {79328#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79328#(< main_~i~0 993)} is VALID [2022-04-15 06:02:21,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {79335#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79328#(< main_~i~0 993)} is VALID [2022-04-15 06:02:21,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {79335#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79335#(< main_~i~0 992)} is VALID [2022-04-15 06:02:21,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {79342#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79335#(< main_~i~0 992)} is VALID [2022-04-15 06:02:21,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {79342#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79342#(< main_~i~0 991)} is VALID [2022-04-15 06:02:21,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {79349#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79342#(< main_~i~0 991)} is VALID [2022-04-15 06:02:21,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {79349#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79349#(< main_~i~0 990)} is VALID [2022-04-15 06:02:21,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {79356#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79349#(< main_~i~0 990)} is VALID [2022-04-15 06:02:21,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {79356#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79356#(< main_~i~0 989)} is VALID [2022-04-15 06:02:21,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {79363#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79356#(< main_~i~0 989)} is VALID [2022-04-15 06:02:21,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {79363#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79363#(< main_~i~0 988)} is VALID [2022-04-15 06:02:21,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {79370#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79363#(< main_~i~0 988)} is VALID [2022-04-15 06:02:21,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {79370#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79370#(< main_~i~0 987)} is VALID [2022-04-15 06:02:21,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {79377#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79370#(< main_~i~0 987)} is VALID [2022-04-15 06:02:21,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {79377#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79377#(< main_~i~0 986)} is VALID [2022-04-15 06:02:21,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {79384#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79377#(< main_~i~0 986)} is VALID [2022-04-15 06:02:21,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {79384#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79384#(< main_~i~0 985)} is VALID [2022-04-15 06:02:21,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {79391#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79384#(< main_~i~0 985)} is VALID [2022-04-15 06:02:21,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {79391#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79391#(< main_~i~0 984)} is VALID [2022-04-15 06:02:21,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {79398#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79391#(< main_~i~0 984)} is VALID [2022-04-15 06:02:21,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {79398#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79398#(< main_~i~0 983)} is VALID [2022-04-15 06:02:21,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {79405#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79398#(< main_~i~0 983)} is VALID [2022-04-15 06:02:21,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {79405#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79405#(< main_~i~0 982)} is VALID [2022-04-15 06:02:21,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {79412#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79405#(< main_~i~0 982)} is VALID [2022-04-15 06:02:21,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {79412#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79412#(< main_~i~0 981)} is VALID [2022-04-15 06:02:21,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {79419#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79412#(< main_~i~0 981)} is VALID [2022-04-15 06:02:21,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {79419#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79419#(< main_~i~0 980)} is VALID [2022-04-15 06:02:21,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {79426#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79419#(< main_~i~0 980)} is VALID [2022-04-15 06:02:21,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {79426#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79426#(< main_~i~0 979)} is VALID [2022-04-15 06:02:21,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {79433#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79426#(< main_~i~0 979)} is VALID [2022-04-15 06:02:21,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {79433#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79433#(< main_~i~0 978)} is VALID [2022-04-15 06:02:21,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {79440#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79433#(< main_~i~0 978)} is VALID [2022-04-15 06:02:21,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {79440#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79440#(< main_~i~0 977)} is VALID [2022-04-15 06:02:21,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {79447#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79440#(< main_~i~0 977)} is VALID [2022-04-15 06:02:21,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {79447#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79447#(< main_~i~0 976)} is VALID [2022-04-15 06:02:21,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {79454#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79447#(< main_~i~0 976)} is VALID [2022-04-15 06:02:21,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {79454#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79454#(< main_~i~0 975)} is VALID [2022-04-15 06:02:21,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {79461#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79454#(< main_~i~0 975)} is VALID [2022-04-15 06:02:21,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {79461#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79461#(< main_~i~0 974)} is VALID [2022-04-15 06:02:21,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {79468#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79461#(< main_~i~0 974)} is VALID [2022-04-15 06:02:21,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {79468#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79468#(< main_~i~0 973)} is VALID [2022-04-15 06:02:21,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {79475#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79468#(< main_~i~0 973)} is VALID [2022-04-15 06:02:21,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {79475#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79475#(< main_~i~0 972)} is VALID [2022-04-15 06:02:21,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {79482#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79475#(< main_~i~0 972)} is VALID [2022-04-15 06:02:21,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {79482#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79482#(< main_~i~0 971)} is VALID [2022-04-15 06:02:21,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {79489#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79482#(< main_~i~0 971)} is VALID [2022-04-15 06:02:21,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {79489#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79489#(< main_~i~0 970)} is VALID [2022-04-15 06:02:21,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {79489#(< main_~i~0 970)} is VALID [2022-04-15 06:02:21,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {79496#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {79496#(< main_~i~0 969)} is VALID [2022-04-15 06:02:21,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {78636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {79496#(< main_~i~0 969)} is VALID [2022-04-15 06:02:21,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {78636#true} call #t~ret5 := main(); {78636#true} is VALID [2022-04-15 06:02:21,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78636#true} {78636#true} #58#return; {78636#true} is VALID [2022-04-15 06:02:21,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {78636#true} assume true; {78636#true} is VALID [2022-04-15 06:02:21,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {78636#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(10, 2); {78636#true} is VALID [2022-04-15 06:02:21,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {78636#true} call ULTIMATE.init(); {78636#true} is VALID [2022-04-15 06:02:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:21,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351738643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:21,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:21,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-15 06:02:21,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:21,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569831841] [2022-04-15 06:02:21,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569831841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:21,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:21,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:02:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022072543] [2022-04-15 06:02:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 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 128 [2022-04-15 06:02:21,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:21,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have 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:21,712 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:02:21,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:02:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:02:21,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 06:02:21,716 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have 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,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:34,818 INFO L93 Difference]: Finished difference Result 359 states and 414 transitions. [2022-04-15 06:02:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:02:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 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 128 [2022-04-15 06:02:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have 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,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 409 transitions. [2022-04-15 06:02:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 409 transitions. [2022-04-15 06:02:34,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 409 transitions. [2022-04-15 06:02:35,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:35,197 INFO L225 Difference]: With dead ends: 359 [2022-04-15 06:02:35,197 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 06:02:35,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 06:02:35,199 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1028 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:35,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 31 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:02:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 06:02:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 131. [2022-04-15 06:02:36,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:36,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:36,285 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:36,285 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:36,291 INFO L93 Difference]: Finished difference Result 345 states and 399 transitions. [2022-04-15 06:02:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 399 transitions. [2022-04-15 06:02:36,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:36,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:36,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 06:02:36,292 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 06:02:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:36,298 INFO L93 Difference]: Finished difference Result 345 states and 399 transitions. [2022-04-15 06:02:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 399 transitions. [2022-04-15 06:02:36,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:36,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:36,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:36,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-04-15 06:02:36,301 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2022-04-15 06:02:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:36,301 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-04-15 06:02:36,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 2 states have call successors, (3), 3 states have 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:36,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 132 transitions. [2022-04-15 06:02:36,670 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:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 06:02:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:02:36,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:36,671 INFO L499 BasicCegarLoop]: trace histogram [55, 55, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:36,699 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:02:36,871 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:02:36,871 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1869249795, now seen corresponding path program 111 times [2022-04-15 06:02:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:36,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269576613] [2022-04-15 06:02:36,876 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:36,877 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:36,877 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1869249795, now seen corresponding path program 112 times [2022-04-15 06:02:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:36,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202534581] [2022-04-15 06:02:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {81361#(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(10, 2); {81300#true} is VALID [2022-04-15 06:02:38,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 06:02:38,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 06:02:38,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:38,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {81361#(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(10, 2); {81300#true} is VALID [2022-04-15 06:02:38,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 06:02:38,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 06:02:38,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 06:02:38,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81305#(= main_~i~0 0)} is VALID [2022-04-15 06:02:38,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {81305#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81305#(= main_~i~0 0)} is VALID [2022-04-15 06:02:38,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {81305#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:38,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {81306#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:38,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {81306#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:38,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {81307#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 06:02:38,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {81307#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:38,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {81308#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:38,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {81308#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:38,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {81309#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:38,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {81309#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:38,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {81310#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:38,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {81310#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:38,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {81311#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:38,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {81311#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:38,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {81312#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:38,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {81312#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:38,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {81313#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:38,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {81313#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:38,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {81314#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 06:02:38,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:38,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {81315#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:38,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:38,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:38,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {81316#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:38,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {81317#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:38,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {81317#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:38,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {81318#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:38,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {81318#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:38,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {81319#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:38,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {81319#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:38,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {81320#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:38,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {81320#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:38,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {81321#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 06:02:38,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {81321#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:38,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {81322#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:38,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {81322#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:38,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {81323#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:38,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {81323#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:38,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {81324#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:38,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {81324#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:38,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {81325#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:38,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {81325#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:38,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {81326#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:38,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {81326#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:38,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {81327#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:38,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {81327#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:38,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {81328#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 06:02:38,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {81328#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:38,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {81329#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:38,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {81329#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:38,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {81330#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:38,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {81330#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:38,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {81331#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:38,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {81331#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:38,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {81332#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:38,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {81332#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:38,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {81333#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:38,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {81333#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:38,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {81334#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:38,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {81334#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:38,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {81335#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -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 30)} is VALID [2022-04-15 06:02:38,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {81335#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:38,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {81336#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:38,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {81336#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:38,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {81337#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:38,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {81337#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:38,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {81338#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:38,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {81338#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:38,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {81339#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:38,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {81339#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:38,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {81340#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:38,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {81340#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:38,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {81341#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:38,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {81341#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:38,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {81342#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -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 37)} is VALID [2022-04-15 06:02:38,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {81342#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:38,226 INFO L290 TraceCheckUtils]: 82: Hoare triple {81343#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:38,226 INFO L290 TraceCheckUtils]: 83: Hoare triple {81343#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:38,226 INFO L290 TraceCheckUtils]: 84: Hoare triple {81344#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:38,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {81344#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:38,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {81345#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:38,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {81345#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:38,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {81346#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:38,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {81346#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:38,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {81347#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:38,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {81347#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:38,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {81348#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:38,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {81348#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:38,229 INFO L290 TraceCheckUtils]: 94: Hoare triple {81349#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -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 44)} is VALID [2022-04-15 06:02:38,230 INFO L290 TraceCheckUtils]: 95: Hoare triple {81349#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:38,230 INFO L290 TraceCheckUtils]: 96: Hoare triple {81350#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:38,231 INFO L290 TraceCheckUtils]: 97: Hoare triple {81350#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:38,231 INFO L290 TraceCheckUtils]: 98: Hoare triple {81351#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:38,231 INFO L290 TraceCheckUtils]: 99: Hoare triple {81351#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:38,231 INFO L290 TraceCheckUtils]: 100: Hoare triple {81352#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:38,232 INFO L290 TraceCheckUtils]: 101: Hoare triple {81352#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:38,232 INFO L290 TraceCheckUtils]: 102: Hoare triple {81353#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:38,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {81353#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:38,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {81354#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:38,233 INFO L290 TraceCheckUtils]: 105: Hoare triple {81354#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:38,233 INFO L290 TraceCheckUtils]: 106: Hoare triple {81355#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:38,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {81355#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:38,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {81356#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -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 51)} is VALID [2022-04-15 06:02:38,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {81356#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:38,235 INFO L290 TraceCheckUtils]: 110: Hoare triple {81357#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:38,235 INFO L290 TraceCheckUtils]: 111: Hoare triple {81357#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:38,235 INFO L290 TraceCheckUtils]: 112: Hoare triple {81358#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:38,236 INFO L290 TraceCheckUtils]: 113: Hoare triple {81358#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:38,236 INFO L290 TraceCheckUtils]: 114: Hoare triple {81359#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:38,236 INFO L290 TraceCheckUtils]: 115: Hoare triple {81359#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81360#(<= main_~i~0 55)} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 116: Hoare triple {81360#(<= main_~i~0 55)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 06:02:38,237 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 06:02:38,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 06:02:38,238 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 06:02:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:38,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202534581] [2022-04-15 06:02:38,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202534581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:38,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490908990] [2022-04-15 06:02:38,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:38,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:38,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:38,240 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:02:38,240 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:02:38,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:38,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:38,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:02:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:39,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81300#true} is VALID [2022-04-15 06:02:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#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(10, 2); {81300#true} is VALID [2022-04-15 06:02:39,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 06:02:39,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 06:02:39,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 06:02:39,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81380#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:39,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {81380#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81380#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:39,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {81380#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:39,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {81306#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81306#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:39,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {81306#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:39,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {81307#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 06:02:39,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {81307#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:39,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {81308#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81308#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:39,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {81308#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:39,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {81309#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81309#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:39,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {81309#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:39,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {81310#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81310#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:39,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {81310#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:39,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {81311#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81311#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:39,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {81311#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:39,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {81312#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81312#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:39,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {81312#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:39,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {81313#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81313#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:39,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {81313#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:39,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {81314#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 06:02:39,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {81314#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:39,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {81315#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81315#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:39,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {81315#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:39,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {81316#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81316#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:39,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {81316#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:39,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {81317#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81317#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:39,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {81317#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:39,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {81318#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81318#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:39,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {81318#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:39,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {81319#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81319#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:39,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {81319#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:39,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {81320#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81320#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:39,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {81320#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:39,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {81321#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 06:02:39,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {81321#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:39,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {81322#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81322#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:39,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {81322#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:39,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {81323#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81323#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:39,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {81323#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:39,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {81324#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81324#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:39,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {81324#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:39,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {81325#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81325#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:39,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {81325#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:39,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {81326#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81326#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:39,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {81326#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:39,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {81327#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81327#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:39,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {81327#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:39,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {81328#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 06:02:39,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {81328#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:39,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {81329#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81329#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:39,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {81329#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:39,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {81330#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81330#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:39,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {81330#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:39,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {81331#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81331#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:39,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {81331#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:39,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {81332#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81332#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:39,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {81332#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:39,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {81333#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81333#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:39,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {81333#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:39,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {81334#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81334#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:39,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {81334#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:39,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {81335#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -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 30)} is VALID [2022-04-15 06:02:39,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {81335#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:39,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {81336#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81336#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:39,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {81336#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:39,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {81337#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81337#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:39,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {81337#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:39,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {81338#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81338#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:39,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {81338#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:39,449 INFO L290 TraceCheckUtils]: 74: Hoare triple {81339#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81339#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:39,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {81339#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:39,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {81340#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81340#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:39,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {81340#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:39,450 INFO L290 TraceCheckUtils]: 78: Hoare triple {81341#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81341#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:39,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {81341#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:39,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {81342#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -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 37)} is VALID [2022-04-15 06:02:39,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {81342#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:39,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {81343#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81343#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:39,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {81343#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:39,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {81344#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81344#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:39,453 INFO L290 TraceCheckUtils]: 85: Hoare triple {81344#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:39,453 INFO L290 TraceCheckUtils]: 86: Hoare triple {81345#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81345#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:39,453 INFO L290 TraceCheckUtils]: 87: Hoare triple {81345#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:39,454 INFO L290 TraceCheckUtils]: 88: Hoare triple {81346#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81346#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:39,454 INFO L290 TraceCheckUtils]: 89: Hoare triple {81346#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:39,454 INFO L290 TraceCheckUtils]: 90: Hoare triple {81347#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81347#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:39,455 INFO L290 TraceCheckUtils]: 91: Hoare triple {81347#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:39,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {81348#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81348#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:39,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {81348#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:39,456 INFO L290 TraceCheckUtils]: 94: Hoare triple {81349#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -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 44)} is VALID [2022-04-15 06:02:39,456 INFO L290 TraceCheckUtils]: 95: Hoare triple {81349#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:39,456 INFO L290 TraceCheckUtils]: 96: Hoare triple {81350#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81350#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:39,457 INFO L290 TraceCheckUtils]: 97: Hoare triple {81350#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:39,457 INFO L290 TraceCheckUtils]: 98: Hoare triple {81351#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81351#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:39,457 INFO L290 TraceCheckUtils]: 99: Hoare triple {81351#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:39,458 INFO L290 TraceCheckUtils]: 100: Hoare triple {81352#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81352#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:39,458 INFO L290 TraceCheckUtils]: 101: Hoare triple {81352#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:39,458 INFO L290 TraceCheckUtils]: 102: Hoare triple {81353#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81353#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:39,459 INFO L290 TraceCheckUtils]: 103: Hoare triple {81353#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:39,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {81354#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81354#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:39,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {81354#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:39,460 INFO L290 TraceCheckUtils]: 106: Hoare triple {81355#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81355#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:39,460 INFO L290 TraceCheckUtils]: 107: Hoare triple {81355#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:39,460 INFO L290 TraceCheckUtils]: 108: Hoare triple {81356#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -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 51)} is VALID [2022-04-15 06:02:39,461 INFO L290 TraceCheckUtils]: 109: Hoare triple {81356#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:39,461 INFO L290 TraceCheckUtils]: 110: Hoare triple {81357#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81357#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:39,461 INFO L290 TraceCheckUtils]: 111: Hoare triple {81357#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:39,462 INFO L290 TraceCheckUtils]: 112: Hoare triple {81358#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81358#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:39,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {81358#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:39,462 INFO L290 TraceCheckUtils]: 114: Hoare triple {81359#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81359#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 115: Hoare triple {81359#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81360#(<= main_~i~0 55)} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 116: Hoare triple {81360#(<= main_~i~0 55)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:39,463 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 06:02:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:39,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:43,115 INFO L290 TraceCheckUtils]: 129: Hoare triple {81301#false} assume !false; {81301#false} is VALID [2022-04-15 06:02:43,115 INFO L290 TraceCheckUtils]: 128: Hoare triple {81301#false} assume 0 == ~cond; {81301#false} is VALID [2022-04-15 06:02:43,115 INFO L290 TraceCheckUtils]: 127: Hoare triple {81301#false} ~cond := #in~cond; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L272 TraceCheckUtils]: 126: Hoare triple {81301#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 125: Hoare triple {81301#false} assume !(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 124: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 123: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 120: Hoare triple {81301#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 119: Hoare triple {81301#false} assume !!(0 != #t~mem4);havoc #t~mem4; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {81301#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 117: Hoare triple {81301#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {81301#false} is VALID [2022-04-15 06:02:43,116 INFO L290 TraceCheckUtils]: 116: Hoare triple {81792#(< main_~i~0 1023)} assume !(~i~0 < 1023); {81301#false} is VALID [2022-04-15 06:02:43,117 INFO L290 TraceCheckUtils]: 115: Hoare triple {81796#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81792#(< main_~i~0 1023)} is VALID [2022-04-15 06:02:43,117 INFO L290 TraceCheckUtils]: 114: Hoare triple {81796#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81796#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:43,118 INFO L290 TraceCheckUtils]: 113: Hoare triple {81803#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81796#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:43,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {81803#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81803#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:43,118 INFO L290 TraceCheckUtils]: 111: Hoare triple {81810#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81803#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:43,118 INFO L290 TraceCheckUtils]: 110: Hoare triple {81810#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81810#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:43,119 INFO L290 TraceCheckUtils]: 109: Hoare triple {81817#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81810#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:43,119 INFO L290 TraceCheckUtils]: 108: Hoare triple {81817#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81817#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:43,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {81824#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81817#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:43,120 INFO L290 TraceCheckUtils]: 106: Hoare triple {81824#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81824#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:43,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {81831#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81824#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:43,120 INFO L290 TraceCheckUtils]: 104: Hoare triple {81831#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81831#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:43,121 INFO L290 TraceCheckUtils]: 103: Hoare triple {81838#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81831#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:43,121 INFO L290 TraceCheckUtils]: 102: Hoare triple {81838#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81838#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:43,122 INFO L290 TraceCheckUtils]: 101: Hoare triple {81845#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81838#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:43,122 INFO L290 TraceCheckUtils]: 100: Hoare triple {81845#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81845#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:43,122 INFO L290 TraceCheckUtils]: 99: Hoare triple {81852#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81845#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:43,122 INFO L290 TraceCheckUtils]: 98: Hoare triple {81852#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81852#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:43,123 INFO L290 TraceCheckUtils]: 97: Hoare triple {81859#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81852#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:43,123 INFO L290 TraceCheckUtils]: 96: Hoare triple {81859#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81859#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:43,124 INFO L290 TraceCheckUtils]: 95: Hoare triple {81866#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81859#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:43,124 INFO L290 TraceCheckUtils]: 94: Hoare triple {81866#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81866#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:43,124 INFO L290 TraceCheckUtils]: 93: Hoare triple {81873#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81866#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:43,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {81873#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81873#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:43,125 INFO L290 TraceCheckUtils]: 91: Hoare triple {81880#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81873#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:43,125 INFO L290 TraceCheckUtils]: 90: Hoare triple {81880#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81880#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:43,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {81887#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81880#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:43,126 INFO L290 TraceCheckUtils]: 88: Hoare triple {81887#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81887#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:43,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {81894#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81887#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:43,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {81894#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81894#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:43,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {81901#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81894#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:43,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {81901#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81901#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:43,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {81908#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81901#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:43,128 INFO L290 TraceCheckUtils]: 82: Hoare triple {81908#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81908#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:43,128 INFO L290 TraceCheckUtils]: 81: Hoare triple {81915#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81908#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:43,128 INFO L290 TraceCheckUtils]: 80: Hoare triple {81915#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81915#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:43,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {81922#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81915#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:43,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {81922#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81922#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:43,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {81929#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81922#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:43,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {81929#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81929#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:43,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {81936#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81929#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:43,130 INFO L290 TraceCheckUtils]: 74: Hoare triple {81936#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81936#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:43,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {81943#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81936#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:43,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {81943#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81943#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:43,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {81950#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81943#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:43,132 INFO L290 TraceCheckUtils]: 70: Hoare triple {81950#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81950#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:43,132 INFO L290 TraceCheckUtils]: 69: Hoare triple {81957#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81950#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:43,132 INFO L290 TraceCheckUtils]: 68: Hoare triple {81957#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81957#(< main_~i~0 999)} is VALID [2022-04-15 06:02:43,133 INFO L290 TraceCheckUtils]: 67: Hoare triple {81964#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81957#(< main_~i~0 999)} is VALID [2022-04-15 06:02:43,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {81964#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81964#(< main_~i~0 998)} is VALID [2022-04-15 06:02:43,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {81971#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81964#(< main_~i~0 998)} is VALID [2022-04-15 06:02:43,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {81971#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81971#(< main_~i~0 997)} is VALID [2022-04-15 06:02:43,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {81978#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81971#(< main_~i~0 997)} is VALID [2022-04-15 06:02:43,134 INFO L290 TraceCheckUtils]: 62: Hoare triple {81978#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81978#(< main_~i~0 996)} is VALID [2022-04-15 06:02:43,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {81985#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81978#(< main_~i~0 996)} is VALID [2022-04-15 06:02:43,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {81985#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81985#(< main_~i~0 995)} is VALID [2022-04-15 06:02:43,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {81992#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81985#(< main_~i~0 995)} is VALID [2022-04-15 06:02:43,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {81992#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81992#(< main_~i~0 994)} is VALID [2022-04-15 06:02:43,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {81999#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81992#(< main_~i~0 994)} is VALID [2022-04-15 06:02:43,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {81999#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81999#(< main_~i~0 993)} is VALID [2022-04-15 06:02:43,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {82006#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81999#(< main_~i~0 993)} is VALID [2022-04-15 06:02:43,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {82006#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82006#(< main_~i~0 992)} is VALID [2022-04-15 06:02:43,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {82013#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82006#(< main_~i~0 992)} is VALID [2022-04-15 06:02:43,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {82013#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82013#(< main_~i~0 991)} is VALID [2022-04-15 06:02:43,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {82020#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82013#(< main_~i~0 991)} is VALID [2022-04-15 06:02:43,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {82020#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82020#(< main_~i~0 990)} is VALID [2022-04-15 06:02:43,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {82027#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82020#(< main_~i~0 990)} is VALID [2022-04-15 06:02:43,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {82027#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82027#(< main_~i~0 989)} is VALID [2022-04-15 06:02:43,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {82034#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82027#(< main_~i~0 989)} is VALID [2022-04-15 06:02:43,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {82034#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82034#(< main_~i~0 988)} is VALID [2022-04-15 06:02:43,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {82041#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82034#(< main_~i~0 988)} is VALID [2022-04-15 06:02:43,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {82041#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82041#(< main_~i~0 987)} is VALID [2022-04-15 06:02:43,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {82048#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82041#(< main_~i~0 987)} is VALID [2022-04-15 06:02:43,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {82048#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82048#(< main_~i~0 986)} is VALID [2022-04-15 06:02:43,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {82055#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82048#(< main_~i~0 986)} is VALID [2022-04-15 06:02:43,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {82055#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82055#(< main_~i~0 985)} is VALID [2022-04-15 06:02:43,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {82062#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82055#(< main_~i~0 985)} is VALID [2022-04-15 06:02:43,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {82062#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82062#(< main_~i~0 984)} is VALID [2022-04-15 06:02:43,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {82069#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82062#(< main_~i~0 984)} is VALID [2022-04-15 06:02:43,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {82069#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82069#(< main_~i~0 983)} is VALID [2022-04-15 06:02:43,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {82076#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82069#(< main_~i~0 983)} is VALID [2022-04-15 06:02:43,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {82076#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82076#(< main_~i~0 982)} is VALID [2022-04-15 06:02:43,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {82083#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82076#(< main_~i~0 982)} is VALID [2022-04-15 06:02:43,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {82083#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82083#(< main_~i~0 981)} is VALID [2022-04-15 06:02:43,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {82090#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82083#(< main_~i~0 981)} is VALID [2022-04-15 06:02:43,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {82090#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82090#(< main_~i~0 980)} is VALID [2022-04-15 06:02:43,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {82097#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82090#(< main_~i~0 980)} is VALID [2022-04-15 06:02:43,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {82097#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82097#(< main_~i~0 979)} is VALID [2022-04-15 06:02:43,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {82104#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82097#(< main_~i~0 979)} is VALID [2022-04-15 06:02:43,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {82104#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82104#(< main_~i~0 978)} is VALID [2022-04-15 06:02:43,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {82111#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82104#(< main_~i~0 978)} is VALID [2022-04-15 06:02:43,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {82111#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82111#(< main_~i~0 977)} is VALID [2022-04-15 06:02:43,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {82118#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82111#(< main_~i~0 977)} is VALID [2022-04-15 06:02:43,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {82118#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82118#(< main_~i~0 976)} is VALID [2022-04-15 06:02:43,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {82125#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82118#(< main_~i~0 976)} is VALID [2022-04-15 06:02:43,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {82125#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82125#(< main_~i~0 975)} is VALID [2022-04-15 06:02:43,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {82132#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82125#(< main_~i~0 975)} is VALID [2022-04-15 06:02:43,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {82132#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82132#(< main_~i~0 974)} is VALID [2022-04-15 06:02:43,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {82139#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82132#(< main_~i~0 974)} is VALID [2022-04-15 06:02:43,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {82139#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82139#(< main_~i~0 973)} is VALID [2022-04-15 06:02:43,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {82146#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82139#(< main_~i~0 973)} is VALID [2022-04-15 06:02:43,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {82146#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82146#(< main_~i~0 972)} is VALID [2022-04-15 06:02:43,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {82153#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82146#(< main_~i~0 972)} is VALID [2022-04-15 06:02:43,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {82153#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82153#(< main_~i~0 971)} is VALID [2022-04-15 06:02:43,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {82160#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82153#(< main_~i~0 971)} is VALID [2022-04-15 06:02:43,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {82160#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82160#(< main_~i~0 970)} is VALID [2022-04-15 06:02:43,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {82167#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82160#(< main_~i~0 970)} is VALID [2022-04-15 06:02:43,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {82167#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82167#(< main_~i~0 969)} is VALID [2022-04-15 06:02:43,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {82174#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82167#(< main_~i~0 969)} is VALID [2022-04-15 06:02:43,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {82174#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {82174#(< main_~i~0 968)} is VALID [2022-04-15 06:02:43,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {81300#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {82174#(< main_~i~0 968)} is VALID [2022-04-15 06:02:43,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {81300#true} call #t~ret5 := main(); {81300#true} is VALID [2022-04-15 06:02:43,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81300#true} {81300#true} #58#return; {81300#true} is VALID [2022-04-15 06:02:43,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {81300#true} assume true; {81300#true} is VALID [2022-04-15 06:02:43,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {81300#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(10, 2); {81300#true} is VALID [2022-04-15 06:02:43,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {81300#true} call ULTIMATE.init(); {81300#true} is VALID [2022-04-15 06:02:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:02:43,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490908990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:43,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 06:02:43,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:43,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269576613] [2022-04-15 06:02:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269576613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:43,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:02:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933452568] [2022-04-15 06:02:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 06:02:43,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:43,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have 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:43,236 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:02:43,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:02:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:02:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:02:43,238 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have 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:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:56,295 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2022-04-15 06:02:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:02:56,295 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 06:02:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have 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:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 416 transitions. [2022-04-15 06:02:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have 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:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 416 transitions. [2022-04-15 06:02:56,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 416 transitions. [2022-04-15 06:02:56,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:56,658 INFO L225 Difference]: With dead ends: 365 [2022-04-15 06:02:56,658 INFO L226 Difference]: Without dead ends: 351 [2022-04-15 06:02:56,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:02:56,660 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 867 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:56,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 46 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:02:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-15 06:02:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 133. [2022-04-15 06:02:57,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:57,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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:57,828 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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:57,828 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:57,834 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2022-04-15 06:02:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2022-04-15 06:02:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:57,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:57,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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 351 states. [2022-04-15 06:02:57,835 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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 351 states. [2022-04-15 06:02:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:57,840 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2022-04-15 06:02:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2022-04-15 06:02:57,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:57,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:57,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:57,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 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:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2022-04-15 06:02:57,843 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2022-04-15 06:02:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:57,843 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2022-04-15 06:02:57,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 58 states have internal predecessors, (122), 2 states have call successors, (3), 3 states have 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:57,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 134 transitions. [2022-04-15 06:02:58,202 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:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 06:02:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 06:02:58,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:58,203 INFO L499 BasicCegarLoop]: trace histogram [56, 56, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:58,231 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:02:58,419 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:02:58,419 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1479898783, now seen corresponding path program 113 times [2022-04-15 06:02:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139403986] [2022-04-15 06:02:58,424 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:58,424 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:58,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1479898783, now seen corresponding path program 114 times [2022-04-15 06:02:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:58,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696927167] [2022-04-15 06:02:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:59,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {84070#(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(10, 2); {84008#true} is VALID [2022-04-15 06:02:59,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 06:02:59,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 06:02:59,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:59,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {84070#(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(10, 2); {84008#true} is VALID [2022-04-15 06:02:59,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 06:02:59,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 06:02:59,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 06:02:59,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84013#(= main_~i~0 0)} is VALID [2022-04-15 06:02:59,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {84013#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84013#(= main_~i~0 0)} is VALID [2022-04-15 06:02:59,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {84013#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:59,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {84014#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:59,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {84014#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:59,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {84015#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:59,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {84015#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84016#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:59,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {84016#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84016#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:59,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {84016#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84017#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:59,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {84017#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84017#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:59,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {84017#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84018#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:59,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {84018#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84018#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:59,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {84018#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84019#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:59,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {84019#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84019#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:59,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {84019#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84020#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:59,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {84020#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84020#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:59,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {84020#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84021#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:59,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {84021#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84021#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:59,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {84021#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84022#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:59,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {84022#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84022#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:59,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {84022#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84023#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:59,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {84023#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84023#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:59,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {84023#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84024#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:59,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {84024#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84024#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:59,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {84024#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84025#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:59,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {84025#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84025#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:59,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {84025#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84026#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:59,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {84026#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84026#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:59,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {84026#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84027#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:59,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {84027#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84027#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:59,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {84027#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84028#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:59,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {84028#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84028#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:59,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {84028#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84029#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:59,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {84029#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84029#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:59,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {84029#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84030#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:59,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {84030#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84030#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:59,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {84030#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84031#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:59,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {84031#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84031#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:59,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {84031#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84032#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:59,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {84032#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84032#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:59,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {84032#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84033#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:59,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {84033#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84033#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:59,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {84033#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84034#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:59,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {84034#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84034#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:59,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {84034#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84035#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:59,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {84035#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84035#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:59,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {84035#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84036#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:59,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {84036#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84036#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:59,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {84036#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84037#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:59,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {84037#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84037#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:59,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {84037#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84038#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:59,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {84038#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84038#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:59,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {84038#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84039#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:59,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {84039#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84039#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:59,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {84039#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84040#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:59,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {84040#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84040#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:59,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {84040#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84041#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:59,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {84041#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84041#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:59,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {84041#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84042#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:59,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {84042#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84042#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:59,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {84042#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84043#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:59,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {84043#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84043#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:59,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {84043#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84044#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:59,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {84044#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84044#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:59,985 INFO L290 TraceCheckUtils]: 69: Hoare triple {84044#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84045#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:59,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {84045#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84045#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:59,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {84045#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84046#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:59,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {84046#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84046#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:59,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {84046#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84047#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:59,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {84047#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84047#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:59,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {84047#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84048#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:59,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {84048#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84048#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:59,988 INFO L290 TraceCheckUtils]: 77: Hoare triple {84048#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84049#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:59,988 INFO L290 TraceCheckUtils]: 78: Hoare triple {84049#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84049#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:59,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {84049#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84050#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:59,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {84050#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84050#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:59,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {84050#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84051#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:59,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {84051#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84051#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:59,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {84051#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84052#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:59,991 INFO L290 TraceCheckUtils]: 84: Hoare triple {84052#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84052#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:59,991 INFO L290 TraceCheckUtils]: 85: Hoare triple {84052#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84053#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:59,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {84053#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84053#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:59,992 INFO L290 TraceCheckUtils]: 87: Hoare triple {84053#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84054#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:59,992 INFO L290 TraceCheckUtils]: 88: Hoare triple {84054#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84054#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:59,992 INFO L290 TraceCheckUtils]: 89: Hoare triple {84054#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84055#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:59,993 INFO L290 TraceCheckUtils]: 90: Hoare triple {84055#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84055#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:59,993 INFO L290 TraceCheckUtils]: 91: Hoare triple {84055#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84056#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:59,994 INFO L290 TraceCheckUtils]: 92: Hoare triple {84056#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84056#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:59,994 INFO L290 TraceCheckUtils]: 93: Hoare triple {84056#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84057#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:59,994 INFO L290 TraceCheckUtils]: 94: Hoare triple {84057#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84057#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:59,995 INFO L290 TraceCheckUtils]: 95: Hoare triple {84057#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84058#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:59,995 INFO L290 TraceCheckUtils]: 96: Hoare triple {84058#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84058#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:59,996 INFO L290 TraceCheckUtils]: 97: Hoare triple {84058#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84059#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:59,996 INFO L290 TraceCheckUtils]: 98: Hoare triple {84059#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84059#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:59,996 INFO L290 TraceCheckUtils]: 99: Hoare triple {84059#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84060#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:59,997 INFO L290 TraceCheckUtils]: 100: Hoare triple {84060#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84060#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:59,997 INFO L290 TraceCheckUtils]: 101: Hoare triple {84060#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84061#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:59,997 INFO L290 TraceCheckUtils]: 102: Hoare triple {84061#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84061#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:59,998 INFO L290 TraceCheckUtils]: 103: Hoare triple {84061#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84062#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:59,998 INFO L290 TraceCheckUtils]: 104: Hoare triple {84062#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84062#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:59,999 INFO L290 TraceCheckUtils]: 105: Hoare triple {84062#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84063#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:59,999 INFO L290 TraceCheckUtils]: 106: Hoare triple {84063#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84063#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:59,999 INFO L290 TraceCheckUtils]: 107: Hoare triple {84063#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84064#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:00,000 INFO L290 TraceCheckUtils]: 108: Hoare triple {84064#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84064#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:00,000 INFO L290 TraceCheckUtils]: 109: Hoare triple {84064#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84065#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:00,001 INFO L290 TraceCheckUtils]: 110: Hoare triple {84065#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84065#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:00,001 INFO L290 TraceCheckUtils]: 111: Hoare triple {84065#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84066#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:00,001 INFO L290 TraceCheckUtils]: 112: Hoare triple {84066#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84066#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:00,002 INFO L290 TraceCheckUtils]: 113: Hoare triple {84066#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84067#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:00,002 INFO L290 TraceCheckUtils]: 114: Hoare triple {84067#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84067#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:00,003 INFO L290 TraceCheckUtils]: 115: Hoare triple {84067#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84068#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:00,003 INFO L290 TraceCheckUtils]: 116: Hoare triple {84068#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84068#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:00,003 INFO L290 TraceCheckUtils]: 117: Hoare triple {84068#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84069#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 118: Hoare triple {84069#(<= main_~i~0 56)} assume !(~i~0 < 1023); {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 119: Hoare triple {84009#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 120: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 121: Hoare triple {84009#false} assume !!(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 122: Hoare triple {84009#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 123: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 124: Hoare triple {84009#false} assume !!(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 06:03:00,004 INFO L290 TraceCheckUtils]: 125: Hoare triple {84009#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L290 TraceCheckUtils]: 126: Hoare triple {84009#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L290 TraceCheckUtils]: 127: Hoare triple {84009#false} assume !(0 != #t~mem4);havoc #t~mem4; {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L272 TraceCheckUtils]: 128: Hoare triple {84009#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L290 TraceCheckUtils]: 129: Hoare triple {84009#false} ~cond := #in~cond; {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L290 TraceCheckUtils]: 130: Hoare triple {84009#false} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 06:03:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:00,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696927167] [2022-04-15 06:03:00,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696927167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:00,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118705223] [2022-04-15 06:03:00,006 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:00,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:00,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:00,008 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:00,009 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:00,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:03:00,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:00,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:03:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:00,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:00,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#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(10, 2); {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 91: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 92: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 101: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 104: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 105: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 109: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 113: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 114: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 116: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 117: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 118: Hoare triple {84008#true} assume !(~i~0 < 1023); {84008#true} is VALID [2022-04-15 06:03:00,932 INFO L290 TraceCheckUtils]: 119: Hoare triple {84008#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84431#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:00,933 INFO L290 TraceCheckUtils]: 120: Hoare triple {84431#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84431#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:00,933 INFO L290 TraceCheckUtils]: 121: Hoare triple {84431#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {84431#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:00,934 INFO L290 TraceCheckUtils]: 122: Hoare triple {84431#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:00,934 INFO L290 TraceCheckUtils]: 123: Hoare triple {84014#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84014#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:00,934 INFO L290 TraceCheckUtils]: 124: Hoare triple {84014#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {84014#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:00,935 INFO L290 TraceCheckUtils]: 125: Hoare triple {84014#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:00,935 INFO L290 TraceCheckUtils]: 126: Hoare triple {84015#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84015#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:00,935 INFO L290 TraceCheckUtils]: 127: Hoare triple {84015#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {84015#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:00,936 INFO L272 TraceCheckUtils]: 128: Hoare triple {84015#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:00,936 INFO L290 TraceCheckUtils]: 129: Hoare triple {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:03:00,936 INFO L290 TraceCheckUtils]: 130: Hoare triple {84463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 06:03:00,936 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 06:03:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 06:03:00,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:01,346 INFO L290 TraceCheckUtils]: 131: Hoare triple {84009#false} assume !false; {84009#false} is VALID [2022-04-15 06:03:01,347 INFO L290 TraceCheckUtils]: 130: Hoare triple {84463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {84009#false} is VALID [2022-04-15 06:03:01,347 INFO L290 TraceCheckUtils]: 129: Hoare triple {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:03:01,348 INFO L272 TraceCheckUtils]: 128: Hoare triple {84479#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {84459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:01,348 INFO L290 TraceCheckUtils]: 127: Hoare triple {84479#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 06:03:01,349 INFO L290 TraceCheckUtils]: 126: Hoare triple {84479#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 06:03:01,349 INFO L290 TraceCheckUtils]: 125: Hoare triple {84489#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84479#(<= main_~i~0 1024)} is VALID [2022-04-15 06:03:01,350 INFO L290 TraceCheckUtils]: 124: Hoare triple {84489#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 06:03:01,350 INFO L290 TraceCheckUtils]: 123: Hoare triple {84489#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 06:03:01,350 INFO L290 TraceCheckUtils]: 122: Hoare triple {84499#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84489#(<= main_~i~0 1023)} is VALID [2022-04-15 06:03:01,351 INFO L290 TraceCheckUtils]: 121: Hoare triple {84499#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 06:03:01,351 INFO L290 TraceCheckUtils]: 120: Hoare triple {84499#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 119: Hoare triple {84008#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {84499#(<= main_~i~0 1022)} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 118: Hoare triple {84008#true} assume !(~i~0 < 1023); {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 117: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 116: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 115: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 114: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 113: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 112: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,352 INFO L290 TraceCheckUtils]: 111: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 110: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 109: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 108: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 107: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 106: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 105: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 100: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 99: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 98: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 97: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 96: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 95: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 94: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 93: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 92: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,354 INFO L290 TraceCheckUtils]: 91: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 90: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,356 INFO L290 TraceCheckUtils]: 72: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 67: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {84008#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {84008#true} is VALID [2022-04-15 06:03:01,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {84008#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {84008#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {84008#true} call #t~ret5 := main(); {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84008#true} {84008#true} #58#return; {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {84008#true} assume true; {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {84008#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(10, 2); {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {84008#true} call ULTIMATE.init(); {84008#true} is VALID [2022-04-15 06:03:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 06:03:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118705223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:01,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:01,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 7] total 66 [2022-04-15 06:03:01,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:01,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139403986] [2022-04-15 06:03:01,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139403986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:01,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:01,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:03:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676309746] [2022-04-15 06:03:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 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 132 [2022-04-15 06:03:01,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:01,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have 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:01,492 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:03:01,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:03:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:01,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:03:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:03:01,494 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have 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:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:13,558 INFO L93 Difference]: Finished difference Result 371 states and 428 transitions. [2022-04-15 06:03:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:03:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 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 132 [2022-04-15 06:03:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have 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:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 423 transitions. [2022-04-15 06:03:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have 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:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 423 transitions. [2022-04-15 06:03:13,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 423 transitions. [2022-04-15 06:03:13,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:13,988 INFO L225 Difference]: With dead ends: 371 [2022-04-15 06:03:13,988 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 06:03:13,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5551, Invalid=9455, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 06:03:13,990 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 984 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:13,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [984 Valid, 41 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:03:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 06:03:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 135. [2022-04-15 06:03:15,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:15,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:15,155 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:15,155 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,162 INFO L93 Difference]: Finished difference Result 357 states and 413 transitions. [2022-04-15 06:03:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 413 transitions. [2022-04-15 06:03:15,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:15,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:15,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-15 06:03:15,163 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-15 06:03:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,169 INFO L93 Difference]: Finished difference Result 357 states and 413 transitions. [2022-04-15 06:03:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 413 transitions. [2022-04-15 06:03:15,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:15,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:15,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:15,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-04-15 06:03:15,172 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2022-04-15 06:03:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:15,172 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-04-15 06:03:15,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.066666666666667) internal successors, (124), 59 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have 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,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 136 transitions. [2022-04-15 06:03:15,537 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:03:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-04-15 06:03:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 06:03:15,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:15,538 INFO L499 BasicCegarLoop]: trace histogram [57, 57, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:15,565 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:03:15,755 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:03:15,755 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1213789759, now seen corresponding path program 115 times [2022-04-15 06:03:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:15,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758634279] [2022-04-15 06:03:15,760 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:15,760 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:15,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1213789759, now seen corresponding path program 116 times [2022-04-15 06:03:15,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576704984] [2022-04-15 06:03:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {86771#(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(10, 2); {86708#true} is VALID [2022-04-15 06:03:17,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 06:03:17,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 06:03:17,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:17,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {86771#(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(10, 2); {86708#true} is VALID [2022-04-15 06:03:17,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 06:03:17,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 06:03:17,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 06:03:17,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86713#(= main_~i~0 0)} is VALID [2022-04-15 06:03:17,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {86713#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86713#(= main_~i~0 0)} is VALID [2022-04-15 06:03:17,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {86713#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:17,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {86714#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:17,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {86714#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:17,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {86715#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:17,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {86715#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:17,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {86716#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:17,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {86716#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:17,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {86717#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:17,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {86717#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:17,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {86718#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:17,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {86718#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:17,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {86719#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:17,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {86719#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:17,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {86720#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:17,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {86720#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:17,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {86721#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:17,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {86721#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:17,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {86722#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:17,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {86722#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:17,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {86723#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:17,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {86723#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:17,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {86724#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:17,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {86724#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:17,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {86725#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:17,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {86725#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:17,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {86726#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:17,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {86726#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:17,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {86727#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:17,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {86727#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:17,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {86728#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:17,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {86728#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:17,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {86729#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:17,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {86729#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:17,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {86730#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:17,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {86730#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:17,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {86731#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:17,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {86731#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:17,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {86732#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:17,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {86732#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:17,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {86733#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:17,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {86733#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:17,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {86734#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:17,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {86734#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:17,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {86735#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:17,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {86735#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:17,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {86736#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:17,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {86736#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:17,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {86737#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:17,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {86737#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:17,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {86738#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:17,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {86738#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:17,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {86739#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:17,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {86739#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:17,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {86740#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:17,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {86740#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:17,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {86741#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:17,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {86741#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:17,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {86742#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:17,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {86742#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:17,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {86743#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:17,328 INFO L290 TraceCheckUtils]: 67: Hoare triple {86743#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:17,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {86744#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:17,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {86744#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:17,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {86745#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:17,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {86745#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:17,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {86746#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:17,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {86746#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:17,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {86747#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:17,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {86747#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:17,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {86748#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:17,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {86748#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:17,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {86749#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:17,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {86749#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:17,333 INFO L290 TraceCheckUtils]: 80: Hoare triple {86750#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:17,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {86750#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:17,334 INFO L290 TraceCheckUtils]: 82: Hoare triple {86751#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:17,334 INFO L290 TraceCheckUtils]: 83: Hoare triple {86751#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:17,335 INFO L290 TraceCheckUtils]: 84: Hoare triple {86752#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:17,335 INFO L290 TraceCheckUtils]: 85: Hoare triple {86752#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:17,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {86753#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:17,336 INFO L290 TraceCheckUtils]: 87: Hoare triple {86753#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:17,336 INFO L290 TraceCheckUtils]: 88: Hoare triple {86754#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:17,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {86754#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:17,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {86755#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:17,338 INFO L290 TraceCheckUtils]: 91: Hoare triple {86755#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:17,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {86756#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:17,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {86756#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:17,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {86757#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:17,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {86757#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:17,340 INFO L290 TraceCheckUtils]: 96: Hoare triple {86758#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:17,340 INFO L290 TraceCheckUtils]: 97: Hoare triple {86758#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:17,340 INFO L290 TraceCheckUtils]: 98: Hoare triple {86759#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:17,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {86759#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:17,341 INFO L290 TraceCheckUtils]: 100: Hoare triple {86760#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:17,342 INFO L290 TraceCheckUtils]: 101: Hoare triple {86760#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:17,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {86761#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:17,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {86761#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:17,343 INFO L290 TraceCheckUtils]: 104: Hoare triple {86762#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:17,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {86762#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:17,344 INFO L290 TraceCheckUtils]: 106: Hoare triple {86763#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:17,344 INFO L290 TraceCheckUtils]: 107: Hoare triple {86763#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:17,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {86764#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:17,345 INFO L290 TraceCheckUtils]: 109: Hoare triple {86764#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:17,345 INFO L290 TraceCheckUtils]: 110: Hoare triple {86765#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:17,346 INFO L290 TraceCheckUtils]: 111: Hoare triple {86765#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:17,346 INFO L290 TraceCheckUtils]: 112: Hoare triple {86766#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:17,346 INFO L290 TraceCheckUtils]: 113: Hoare triple {86766#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:17,347 INFO L290 TraceCheckUtils]: 114: Hoare triple {86767#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:17,347 INFO L290 TraceCheckUtils]: 115: Hoare triple {86767#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:17,347 INFO L290 TraceCheckUtils]: 116: Hoare triple {86768#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:17,348 INFO L290 TraceCheckUtils]: 117: Hoare triple {86768#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:17,348 INFO L290 TraceCheckUtils]: 118: Hoare triple {86769#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:17,349 INFO L290 TraceCheckUtils]: 119: Hoare triple {86769#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86770#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:17,349 INFO L290 TraceCheckUtils]: 120: Hoare triple {86770#(<= main_~i~0 57)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 06:03:17,349 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 06:03:17,349 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:17,349 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 06:03:17,350 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 06:03:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576704984] [2022-04-15 06:03:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576704984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331037151] [2022-04-15 06:03:17,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:03:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:17,353 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:03:17,354 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:03:17,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:03:17,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:17,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:03:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:18,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86708#true} is VALID [2022-04-15 06:03:18,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#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(10, 2); {86708#true} is VALID [2022-04-15 06:03:18,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 06:03:18,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 06:03:18,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 06:03:18,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86790#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:18,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {86790#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86790#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:18,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {86790#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:18,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {86714#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86714#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:18,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {86714#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:18,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {86715#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86715#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:18,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {86715#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:18,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {86716#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86716#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:18,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {86716#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:18,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {86717#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86717#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:18,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {86717#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:18,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {86718#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86718#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:18,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {86718#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:18,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {86719#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86719#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:18,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {86719#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:18,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {86720#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86720#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:18,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {86720#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:18,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {86721#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86721#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:18,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {86721#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:18,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {86722#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86722#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:18,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {86722#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:18,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {86723#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86723#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:18,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {86723#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:18,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {86724#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86724#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:18,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {86724#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:18,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {86725#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86725#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:18,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {86725#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:18,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {86726#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86726#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:18,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {86726#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:18,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {86727#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86727#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:18,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {86727#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:18,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {86728#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86728#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:18,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {86728#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:18,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {86729#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86729#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:18,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {86729#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:18,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {86730#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86730#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:18,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {86730#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:18,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {86731#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86731#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:18,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {86731#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:18,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {86732#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86732#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:18,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {86732#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:18,834 INFO L290 TraceCheckUtils]: 46: Hoare triple {86733#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86733#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:18,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {86733#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:18,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {86734#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86734#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:18,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {86734#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:18,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {86735#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86735#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:18,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {86735#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:18,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {86736#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86736#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:18,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {86736#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:18,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {86737#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86737#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:18,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {86737#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:18,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {86738#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86738#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:18,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {86738#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:18,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {86739#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86739#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:18,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {86739#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:18,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {86740#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86740#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:18,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {86740#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:18,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {86741#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86741#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:18,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {86741#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:18,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {86742#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86742#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:18,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {86742#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:18,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {86743#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86743#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:18,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {86743#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:18,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {86744#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86744#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:18,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {86744#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:18,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {86745#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86745#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:18,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {86745#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:18,844 INFO L290 TraceCheckUtils]: 72: Hoare triple {86746#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86746#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:18,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {86746#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:18,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {86747#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86747#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:18,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {86747#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:18,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {86748#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86748#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:18,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {86748#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:18,847 INFO L290 TraceCheckUtils]: 78: Hoare triple {86749#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86749#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:18,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {86749#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:18,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {86750#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86750#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:18,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {86750#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:18,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {86751#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86751#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:18,849 INFO L290 TraceCheckUtils]: 83: Hoare triple {86751#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:18,849 INFO L290 TraceCheckUtils]: 84: Hoare triple {86752#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86752#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:18,850 INFO L290 TraceCheckUtils]: 85: Hoare triple {86752#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:18,850 INFO L290 TraceCheckUtils]: 86: Hoare triple {86753#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86753#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:18,850 INFO L290 TraceCheckUtils]: 87: Hoare triple {86753#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:18,851 INFO L290 TraceCheckUtils]: 88: Hoare triple {86754#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86754#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:18,851 INFO L290 TraceCheckUtils]: 89: Hoare triple {86754#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:18,852 INFO L290 TraceCheckUtils]: 90: Hoare triple {86755#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86755#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:18,852 INFO L290 TraceCheckUtils]: 91: Hoare triple {86755#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:18,852 INFO L290 TraceCheckUtils]: 92: Hoare triple {86756#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86756#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:18,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {86756#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:18,853 INFO L290 TraceCheckUtils]: 94: Hoare triple {86757#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86757#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:18,854 INFO L290 TraceCheckUtils]: 95: Hoare triple {86757#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:18,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {86758#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86758#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:18,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {86758#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:18,855 INFO L290 TraceCheckUtils]: 98: Hoare triple {86759#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86759#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:18,855 INFO L290 TraceCheckUtils]: 99: Hoare triple {86759#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:18,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {86760#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86760#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:18,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {86760#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:18,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {86761#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86761#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:18,857 INFO L290 TraceCheckUtils]: 103: Hoare triple {86761#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:18,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {86762#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86762#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:18,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {86762#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:18,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {86763#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86763#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:18,858 INFO L290 TraceCheckUtils]: 107: Hoare triple {86763#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:18,859 INFO L290 TraceCheckUtils]: 108: Hoare triple {86764#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86764#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:18,859 INFO L290 TraceCheckUtils]: 109: Hoare triple {86764#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:18,859 INFO L290 TraceCheckUtils]: 110: Hoare triple {86765#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86765#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:18,860 INFO L290 TraceCheckUtils]: 111: Hoare triple {86765#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:18,860 INFO L290 TraceCheckUtils]: 112: Hoare triple {86766#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86766#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:18,861 INFO L290 TraceCheckUtils]: 113: Hoare triple {86766#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:18,861 INFO L290 TraceCheckUtils]: 114: Hoare triple {86767#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86767#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:18,861 INFO L290 TraceCheckUtils]: 115: Hoare triple {86767#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:18,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {86768#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86768#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:18,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {86768#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:18,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {86769#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86769#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 119: Hoare triple {86769#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86770#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 120: Hoare triple {86770#(<= main_~i~0 57)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:18,863 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 06:03:18,864 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 06:03:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:18,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:23,404 INFO L290 TraceCheckUtils]: 133: Hoare triple {86709#false} assume !false; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 132: Hoare triple {86709#false} assume 0 == ~cond; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 131: Hoare triple {86709#false} ~cond := #in~cond; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L272 TraceCheckUtils]: 130: Hoare triple {86709#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 129: Hoare triple {86709#false} assume !(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 128: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 127: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 126: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 125: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 124: Hoare triple {86709#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86709#false} is VALID [2022-04-15 06:03:23,405 INFO L290 TraceCheckUtils]: 123: Hoare triple {86709#false} assume !!(0 != #t~mem4);havoc #t~mem4; {86709#false} is VALID [2022-04-15 06:03:23,406 INFO L290 TraceCheckUtils]: 122: Hoare triple {86709#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {86709#false} is VALID [2022-04-15 06:03:23,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {86709#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {86709#false} is VALID [2022-04-15 06:03:23,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {87214#(< main_~i~0 1023)} assume !(~i~0 < 1023); {86709#false} is VALID [2022-04-15 06:03:23,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {87218#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87214#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:23,407 INFO L290 TraceCheckUtils]: 118: Hoare triple {87218#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87218#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:23,407 INFO L290 TraceCheckUtils]: 117: Hoare triple {87225#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87218#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:23,408 INFO L290 TraceCheckUtils]: 116: Hoare triple {87225#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87225#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:23,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {87232#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87225#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:23,408 INFO L290 TraceCheckUtils]: 114: Hoare triple {87232#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87232#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:23,409 INFO L290 TraceCheckUtils]: 113: Hoare triple {87239#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87232#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:23,409 INFO L290 TraceCheckUtils]: 112: Hoare triple {87239#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87239#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:23,410 INFO L290 TraceCheckUtils]: 111: Hoare triple {87246#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87239#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:23,410 INFO L290 TraceCheckUtils]: 110: Hoare triple {87246#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87246#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:23,410 INFO L290 TraceCheckUtils]: 109: Hoare triple {87253#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87246#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:23,411 INFO L290 TraceCheckUtils]: 108: Hoare triple {87253#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87253#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:23,411 INFO L290 TraceCheckUtils]: 107: Hoare triple {87260#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87253#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:23,411 INFO L290 TraceCheckUtils]: 106: Hoare triple {87260#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87260#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:23,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {87267#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87260#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:23,412 INFO L290 TraceCheckUtils]: 104: Hoare triple {87267#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87267#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:23,413 INFO L290 TraceCheckUtils]: 103: Hoare triple {87274#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87267#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:23,413 INFO L290 TraceCheckUtils]: 102: Hoare triple {87274#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87274#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:23,414 INFO L290 TraceCheckUtils]: 101: Hoare triple {87281#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87274#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:23,414 INFO L290 TraceCheckUtils]: 100: Hoare triple {87281#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87281#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:23,414 INFO L290 TraceCheckUtils]: 99: Hoare triple {87288#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87281#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:23,415 INFO L290 TraceCheckUtils]: 98: Hoare triple {87288#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87288#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:23,415 INFO L290 TraceCheckUtils]: 97: Hoare triple {87295#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87288#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:23,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {87295#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87295#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:23,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {87302#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87295#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:23,416 INFO L290 TraceCheckUtils]: 94: Hoare triple {87302#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87302#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:23,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {87309#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87302#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:23,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {87309#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87309#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:23,417 INFO L290 TraceCheckUtils]: 91: Hoare triple {87316#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87309#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:23,418 INFO L290 TraceCheckUtils]: 90: Hoare triple {87316#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87316#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:23,418 INFO L290 TraceCheckUtils]: 89: Hoare triple {87323#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87316#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:23,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {87323#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87323#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:23,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {87330#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87323#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:23,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {87330#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87330#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:23,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {87337#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87330#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:23,420 INFO L290 TraceCheckUtils]: 84: Hoare triple {87337#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87337#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:23,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {87344#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87337#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:23,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {87344#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87344#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:23,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {87351#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87344#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:23,422 INFO L290 TraceCheckUtils]: 80: Hoare triple {87351#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87351#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:23,422 INFO L290 TraceCheckUtils]: 79: Hoare triple {87358#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87351#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:23,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {87358#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87358#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:23,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {87365#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87358#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:23,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {87365#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87365#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:23,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {87372#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87365#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:23,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {87372#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87372#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:23,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {87379#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87372#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:23,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {87379#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87379#(< main_~i~0 999)} is VALID [2022-04-15 06:03:23,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {87386#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87379#(< main_~i~0 999)} is VALID [2022-04-15 06:03:23,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {87386#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87386#(< main_~i~0 998)} is VALID [2022-04-15 06:03:23,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {87393#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87386#(< main_~i~0 998)} is VALID [2022-04-15 06:03:23,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {87393#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87393#(< main_~i~0 997)} is VALID [2022-04-15 06:03:23,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {87400#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87393#(< main_~i~0 997)} is VALID [2022-04-15 06:03:23,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {87400#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87400#(< main_~i~0 996)} is VALID [2022-04-15 06:03:23,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {87407#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87400#(< main_~i~0 996)} is VALID [2022-04-15 06:03:23,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {87407#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87407#(< main_~i~0 995)} is VALID [2022-04-15 06:03:23,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {87414#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87407#(< main_~i~0 995)} is VALID [2022-04-15 06:03:23,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {87414#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87414#(< main_~i~0 994)} is VALID [2022-04-15 06:03:23,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {87421#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87414#(< main_~i~0 994)} is VALID [2022-04-15 06:03:23,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {87421#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87421#(< main_~i~0 993)} is VALID [2022-04-15 06:03:23,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {87428#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87421#(< main_~i~0 993)} is VALID [2022-04-15 06:03:23,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {87428#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87428#(< main_~i~0 992)} is VALID [2022-04-15 06:03:23,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {87435#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87428#(< main_~i~0 992)} is VALID [2022-04-15 06:03:23,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {87435#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87435#(< main_~i~0 991)} is VALID [2022-04-15 06:03:23,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {87442#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87435#(< main_~i~0 991)} is VALID [2022-04-15 06:03:23,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {87442#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87442#(< main_~i~0 990)} is VALID [2022-04-15 06:03:23,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {87449#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87442#(< main_~i~0 990)} is VALID [2022-04-15 06:03:23,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {87449#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87449#(< main_~i~0 989)} is VALID [2022-04-15 06:03:23,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {87456#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87449#(< main_~i~0 989)} is VALID [2022-04-15 06:03:23,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {87456#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87456#(< main_~i~0 988)} is VALID [2022-04-15 06:03:23,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {87463#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87456#(< main_~i~0 988)} is VALID [2022-04-15 06:03:23,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {87463#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87463#(< main_~i~0 987)} is VALID [2022-04-15 06:03:23,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {87470#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87463#(< main_~i~0 987)} is VALID [2022-04-15 06:03:23,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {87470#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87470#(< main_~i~0 986)} is VALID [2022-04-15 06:03:23,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {87477#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87470#(< main_~i~0 986)} is VALID [2022-04-15 06:03:23,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {87477#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87477#(< main_~i~0 985)} is VALID [2022-04-15 06:03:23,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {87484#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87477#(< main_~i~0 985)} is VALID [2022-04-15 06:03:23,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {87484#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87484#(< main_~i~0 984)} is VALID [2022-04-15 06:03:23,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {87491#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87484#(< main_~i~0 984)} is VALID [2022-04-15 06:03:23,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {87491#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87491#(< main_~i~0 983)} is VALID [2022-04-15 06:03:23,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {87498#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87491#(< main_~i~0 983)} is VALID [2022-04-15 06:03:23,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {87498#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87498#(< main_~i~0 982)} is VALID [2022-04-15 06:03:23,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {87505#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87498#(< main_~i~0 982)} is VALID [2022-04-15 06:03:23,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {87505#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87505#(< main_~i~0 981)} is VALID [2022-04-15 06:03:23,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {87512#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87505#(< main_~i~0 981)} is VALID [2022-04-15 06:03:23,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {87512#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87512#(< main_~i~0 980)} is VALID [2022-04-15 06:03:23,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {87519#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87512#(< main_~i~0 980)} is VALID [2022-04-15 06:03:23,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {87519#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87519#(< main_~i~0 979)} is VALID [2022-04-15 06:03:23,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {87526#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87519#(< main_~i~0 979)} is VALID [2022-04-15 06:03:23,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {87526#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87526#(< main_~i~0 978)} is VALID [2022-04-15 06:03:23,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {87533#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87526#(< main_~i~0 978)} is VALID [2022-04-15 06:03:23,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {87533#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87533#(< main_~i~0 977)} is VALID [2022-04-15 06:03:23,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {87540#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87533#(< main_~i~0 977)} is VALID [2022-04-15 06:03:23,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {87540#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87540#(< main_~i~0 976)} is VALID [2022-04-15 06:03:23,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {87547#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87540#(< main_~i~0 976)} is VALID [2022-04-15 06:03:23,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {87547#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87547#(< main_~i~0 975)} is VALID [2022-04-15 06:03:23,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {87554#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87547#(< main_~i~0 975)} is VALID [2022-04-15 06:03:23,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {87554#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87554#(< main_~i~0 974)} is VALID [2022-04-15 06:03:23,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {87561#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87554#(< main_~i~0 974)} is VALID [2022-04-15 06:03:23,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {87561#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87561#(< main_~i~0 973)} is VALID [2022-04-15 06:03:23,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {87568#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87561#(< main_~i~0 973)} is VALID [2022-04-15 06:03:23,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {87568#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87568#(< main_~i~0 972)} is VALID [2022-04-15 06:03:23,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {87575#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87568#(< main_~i~0 972)} is VALID [2022-04-15 06:03:23,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {87575#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87575#(< main_~i~0 971)} is VALID [2022-04-15 06:03:23,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {87582#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87575#(< main_~i~0 971)} is VALID [2022-04-15 06:03:23,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {87582#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87582#(< main_~i~0 970)} is VALID [2022-04-15 06:03:23,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {87589#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87582#(< main_~i~0 970)} is VALID [2022-04-15 06:03:23,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {87589#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87589#(< main_~i~0 969)} is VALID [2022-04-15 06:03:23,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {87596#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87589#(< main_~i~0 969)} is VALID [2022-04-15 06:03:23,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {87596#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87596#(< main_~i~0 968)} is VALID [2022-04-15 06:03:23,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {87603#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87596#(< main_~i~0 968)} is VALID [2022-04-15 06:03:23,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {87603#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87603#(< main_~i~0 967)} is VALID [2022-04-15 06:03:23,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {87610#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87603#(< main_~i~0 967)} is VALID [2022-04-15 06:03:23,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {87610#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87610#(< main_~i~0 966)} is VALID [2022-04-15 06:03:23,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {86708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {87610#(< main_~i~0 966)} is VALID [2022-04-15 06:03:23,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {86708#true} call #t~ret5 := main(); {86708#true} is VALID [2022-04-15 06:03:23,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86708#true} {86708#true} #58#return; {86708#true} is VALID [2022-04-15 06:03:23,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {86708#true} assume true; {86708#true} is VALID [2022-04-15 06:03:23,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {86708#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(10, 2); {86708#true} is VALID [2022-04-15 06:03:23,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {86708#true} call ULTIMATE.init(); {86708#true} is VALID [2022-04-15 06:03:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331037151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:23,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:23,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 06:03:23,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:23,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758634279] [2022-04-15 06:03:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758634279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:23,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:23,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:03:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791418308] [2022-04-15 06:03:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 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 134 [2022-04-15 06:03:23,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:23,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have 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:23,553 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:03:23,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:03:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:23,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:03:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 06:03:23,556 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have 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:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:37,272 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2022-04-15 06:03:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:03:37,272 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 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 134 [2022-04-15 06:03:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have 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:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 430 transitions. [2022-04-15 06:03:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have 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:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 430 transitions. [2022-04-15 06:03:37,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 430 transitions. [2022-04-15 06:03:37,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:37,590 INFO L225 Difference]: With dead ends: 377 [2022-04-15 06:03:37,590 INFO L226 Difference]: Without dead ends: 363 [2022-04-15 06:03:37,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:03:37,592 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 870 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:37,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [870 Valid, 36 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:03:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-15 06:03:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 137. [2022-04-15 06:03:38,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:38,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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:38,516 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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:38,517 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:38,521 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2022-04-15 06:03:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 420 transitions. [2022-04-15 06:03:38,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:38,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:38,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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 363 states. [2022-04-15 06:03:38,522 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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 363 states. [2022-04-15 06:03:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:38,528 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2022-04-15 06:03:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 420 transitions. [2022-04-15 06:03:38,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:38,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:38,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:38,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 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:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-15 06:03:38,531 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2022-04-15 06:03:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:38,532 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-15 06:03:38,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 60 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have 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:38,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-15 06:03:38,945 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:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 06:03:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 06:03:38,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:38,946 INFO L499 BasicCegarLoop]: trace histogram [58, 58, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:38,973 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:03:39,171 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:03:39,172 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 16800867, now seen corresponding path program 117 times [2022-04-15 06:03:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:39,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755371300] [2022-04-15 06:03:39,177 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:39,178 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:39,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash 16800867, now seen corresponding path program 118 times [2022-04-15 06:03:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:39,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352253527] [2022-04-15 06:03:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:40,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {89568#(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(10, 2); {89504#true} is VALID [2022-04-15 06:03:40,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 06:03:40,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 06:03:40,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89568#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:40,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {89568#(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(10, 2); {89504#true} is VALID [2022-04-15 06:03:40,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 06:03:40,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 06:03:40,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 06:03:40,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89509#(= main_~i~0 0)} is VALID [2022-04-15 06:03:40,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {89509#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89509#(= main_~i~0 0)} is VALID [2022-04-15 06:03:40,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {89509#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:40,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {89510#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:40,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {89510#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:40,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {89511#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:40,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {89511#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:40,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {89512#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:40,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {89512#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:40,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {89513#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:40,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {89513#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:40,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {89514#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:40,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {89514#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:40,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {89515#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:40,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {89515#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:40,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {89516#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:40,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {89516#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:40,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {89517#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:40,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {89517#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:40,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {89518#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:40,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {89518#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:40,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {89519#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:40,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {89519#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:40,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {89520#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:40,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {89520#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:40,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {89521#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:40,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {89521#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:40,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {89522#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:40,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {89522#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:40,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {89523#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:40,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {89523#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:40,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {89524#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:40,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {89524#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:40,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {89525#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:40,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {89525#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:40,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {89526#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:40,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {89526#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:40,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {89527#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:40,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {89527#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:40,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {89528#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:40,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {89528#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:40,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {89529#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:40,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {89529#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:40,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {89530#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:40,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {89530#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:40,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {89531#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:40,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {89531#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:40,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {89532#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:40,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {89532#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:40,845 INFO L290 TraceCheckUtils]: 54: Hoare triple {89533#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:40,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {89533#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:40,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {89534#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:40,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {89534#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:40,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {89535#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:40,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {89535#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:40,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {89536#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:40,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {89536#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:40,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {89537#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:40,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {89537#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:40,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {89538#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:40,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {89538#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:40,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {89539#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:40,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {89539#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:40,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {89540#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:40,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {89540#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:40,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {89541#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:40,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {89541#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:40,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {89542#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:40,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {89542#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:40,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {89543#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:40,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {89543#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:40,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {89544#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:40,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {89544#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:40,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {89545#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:40,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {89545#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:40,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {89546#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:40,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {89546#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:40,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {89547#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:40,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {89547#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:40,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {89548#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:40,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {89548#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:40,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {89549#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:40,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {89549#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:40,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {89550#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:40,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {89550#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:40,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {89551#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:40,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {89551#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:40,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {89552#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:40,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {89552#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:40,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {89553#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:40,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {89553#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:40,862 INFO L290 TraceCheckUtils]: 96: Hoare triple {89554#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:40,862 INFO L290 TraceCheckUtils]: 97: Hoare triple {89554#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:40,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {89555#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:40,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {89555#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:40,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {89556#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:40,864 INFO L290 TraceCheckUtils]: 101: Hoare triple {89556#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:40,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {89557#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:40,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {89557#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:40,865 INFO L290 TraceCheckUtils]: 104: Hoare triple {89558#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:40,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {89558#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:40,866 INFO L290 TraceCheckUtils]: 106: Hoare triple {89559#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:40,866 INFO L290 TraceCheckUtils]: 107: Hoare triple {89559#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:40,866 INFO L290 TraceCheckUtils]: 108: Hoare triple {89560#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:40,867 INFO L290 TraceCheckUtils]: 109: Hoare triple {89560#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:40,867 INFO L290 TraceCheckUtils]: 110: Hoare triple {89561#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:40,868 INFO L290 TraceCheckUtils]: 111: Hoare triple {89561#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:40,868 INFO L290 TraceCheckUtils]: 112: Hoare triple {89562#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:40,868 INFO L290 TraceCheckUtils]: 113: Hoare triple {89562#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:40,869 INFO L290 TraceCheckUtils]: 114: Hoare triple {89563#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:40,869 INFO L290 TraceCheckUtils]: 115: Hoare triple {89563#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:40,870 INFO L290 TraceCheckUtils]: 116: Hoare triple {89564#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:40,870 INFO L290 TraceCheckUtils]: 117: Hoare triple {89564#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:40,870 INFO L290 TraceCheckUtils]: 118: Hoare triple {89565#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:40,871 INFO L290 TraceCheckUtils]: 119: Hoare triple {89565#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:40,871 INFO L290 TraceCheckUtils]: 120: Hoare triple {89566#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 121: Hoare triple {89566#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89567#(<= main_~i~0 58)} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 122: Hoare triple {89567#(<= main_~i~0 58)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:40,872 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 06:03:40,873 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 06:03:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:40,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352253527] [2022-04-15 06:03:40,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352253527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:40,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802706114] [2022-04-15 06:03:40,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:40,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:40,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:40,876 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:03:40,877 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:03:41,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:41,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:41,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 06:03:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:42,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89504#true} is VALID [2022-04-15 06:03:42,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#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(10, 2); {89504#true} is VALID [2022-04-15 06:03:42,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 06:03:42,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 06:03:42,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 06:03:42,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89587#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:42,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {89587#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89587#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:42,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {89587#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:42,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {89510#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89510#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:42,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {89510#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:42,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {89511#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89511#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:42,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {89511#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:42,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {89512#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89512#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:42,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {89512#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:42,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {89513#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89513#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:42,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {89513#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:42,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {89514#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89514#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:42,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {89514#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:42,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {89515#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89515#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:42,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {89515#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:42,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {89516#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89516#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:42,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {89516#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:42,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {89517#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89517#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:42,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {89517#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:42,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {89518#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89518#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:42,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {89518#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:42,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {89519#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89519#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:42,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {89519#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:42,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {89520#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89520#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:42,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {89520#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:42,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {89521#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89521#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:42,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {89521#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:42,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {89522#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89522#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:42,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {89522#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:42,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {89523#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89523#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:42,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {89523#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:42,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {89524#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89524#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:42,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {89524#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:42,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {89525#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89525#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:42,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {89525#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:42,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {89526#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89526#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:42,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {89526#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:42,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {89527#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89527#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:42,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {89527#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:42,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {89528#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89528#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:42,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {89528#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:42,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {89529#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89529#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:42,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {89529#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:42,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {89530#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89530#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:42,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {89530#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:42,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {89531#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89531#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:42,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {89531#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:42,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {89532#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89532#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:42,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {89532#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:42,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {89533#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89533#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:42,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {89533#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:42,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {89534#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89534#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:42,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {89534#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:42,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {89535#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89535#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:42,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {89535#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:42,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {89536#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89536#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:42,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {89536#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:42,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {89537#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89537#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:42,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {89537#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:42,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {89538#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89538#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:42,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {89538#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:42,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {89539#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89539#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:42,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {89539#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:42,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {89540#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89540#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:42,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {89540#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:42,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {89541#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89541#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:42,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {89541#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:42,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {89542#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89542#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:42,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {89542#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:42,226 INFO L290 TraceCheckUtils]: 74: Hoare triple {89543#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89543#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:42,226 INFO L290 TraceCheckUtils]: 75: Hoare triple {89543#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:42,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {89544#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89544#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:42,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {89544#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:42,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {89545#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89545#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:42,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {89545#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:42,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {89546#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89546#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:42,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {89546#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:42,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {89547#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89547#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:42,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {89547#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:42,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {89548#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89548#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:42,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {89548#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:42,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {89549#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89549#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:42,230 INFO L290 TraceCheckUtils]: 87: Hoare triple {89549#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:42,231 INFO L290 TraceCheckUtils]: 88: Hoare triple {89550#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89550#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:42,231 INFO L290 TraceCheckUtils]: 89: Hoare triple {89550#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:42,231 INFO L290 TraceCheckUtils]: 90: Hoare triple {89551#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89551#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:42,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {89551#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:42,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {89552#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89552#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:42,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {89552#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:42,233 INFO L290 TraceCheckUtils]: 94: Hoare triple {89553#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89553#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:42,233 INFO L290 TraceCheckUtils]: 95: Hoare triple {89553#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:42,233 INFO L290 TraceCheckUtils]: 96: Hoare triple {89554#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89554#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:42,234 INFO L290 TraceCheckUtils]: 97: Hoare triple {89554#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:42,234 INFO L290 TraceCheckUtils]: 98: Hoare triple {89555#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89555#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:42,234 INFO L290 TraceCheckUtils]: 99: Hoare triple {89555#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:42,235 INFO L290 TraceCheckUtils]: 100: Hoare triple {89556#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89556#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:42,235 INFO L290 TraceCheckUtils]: 101: Hoare triple {89556#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:42,235 INFO L290 TraceCheckUtils]: 102: Hoare triple {89557#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89557#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:42,236 INFO L290 TraceCheckUtils]: 103: Hoare triple {89557#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:42,236 INFO L290 TraceCheckUtils]: 104: Hoare triple {89558#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89558#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:42,236 INFO L290 TraceCheckUtils]: 105: Hoare triple {89558#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:42,237 INFO L290 TraceCheckUtils]: 106: Hoare triple {89559#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89559#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:42,237 INFO L290 TraceCheckUtils]: 107: Hoare triple {89559#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:42,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {89560#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89560#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:42,238 INFO L290 TraceCheckUtils]: 109: Hoare triple {89560#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:42,238 INFO L290 TraceCheckUtils]: 110: Hoare triple {89561#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89561#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:42,238 INFO L290 TraceCheckUtils]: 111: Hoare triple {89561#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:42,239 INFO L290 TraceCheckUtils]: 112: Hoare triple {89562#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89562#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:42,239 INFO L290 TraceCheckUtils]: 113: Hoare triple {89562#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:42,239 INFO L290 TraceCheckUtils]: 114: Hoare triple {89563#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89563#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:42,240 INFO L290 TraceCheckUtils]: 115: Hoare triple {89563#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:42,240 INFO L290 TraceCheckUtils]: 116: Hoare triple {89564#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89564#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:42,240 INFO L290 TraceCheckUtils]: 117: Hoare triple {89564#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:42,241 INFO L290 TraceCheckUtils]: 118: Hoare triple {89565#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89565#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:42,241 INFO L290 TraceCheckUtils]: 119: Hoare triple {89565#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:42,241 INFO L290 TraceCheckUtils]: 120: Hoare triple {89566#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89566#(<= main_~i~0 57)} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 121: Hoare triple {89566#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89567#(<= main_~i~0 58)} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 122: Hoare triple {89567#(<= main_~i~0 58)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:42,242 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 06:03:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:42,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 135: Hoare triple {89505#false} assume !false; {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 134: Hoare triple {89505#false} assume 0 == ~cond; {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 133: Hoare triple {89505#false} ~cond := #in~cond; {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L272 TraceCheckUtils]: 132: Hoare triple {89505#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 131: Hoare triple {89505#false} assume !(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 130: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 129: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:46,570 INFO L290 TraceCheckUtils]: 128: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 127: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 126: Hoare triple {89505#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 125: Hoare triple {89505#false} assume !!(0 != #t~mem4);havoc #t~mem4; {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 124: Hoare triple {89505#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 123: Hoare triple {89505#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {89505#false} is VALID [2022-04-15 06:03:46,571 INFO L290 TraceCheckUtils]: 122: Hoare triple {90017#(< main_~i~0 1023)} assume !(~i~0 < 1023); {89505#false} is VALID [2022-04-15 06:03:46,572 INFO L290 TraceCheckUtils]: 121: Hoare triple {90021#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90017#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:46,572 INFO L290 TraceCheckUtils]: 120: Hoare triple {90021#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90021#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:46,573 INFO L290 TraceCheckUtils]: 119: Hoare triple {90028#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90021#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:46,573 INFO L290 TraceCheckUtils]: 118: Hoare triple {90028#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90028#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:46,574 INFO L290 TraceCheckUtils]: 117: Hoare triple {90035#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90028#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:46,574 INFO L290 TraceCheckUtils]: 116: Hoare triple {90035#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90035#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:46,574 INFO L290 TraceCheckUtils]: 115: Hoare triple {90042#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90035#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:46,575 INFO L290 TraceCheckUtils]: 114: Hoare triple {90042#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90042#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:46,575 INFO L290 TraceCheckUtils]: 113: Hoare triple {90049#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90042#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:46,576 INFO L290 TraceCheckUtils]: 112: Hoare triple {90049#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90049#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:46,576 INFO L290 TraceCheckUtils]: 111: Hoare triple {90056#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90049#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:46,577 INFO L290 TraceCheckUtils]: 110: Hoare triple {90056#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90056#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:46,577 INFO L290 TraceCheckUtils]: 109: Hoare triple {90063#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90056#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:46,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {90063#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90063#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:46,578 INFO L290 TraceCheckUtils]: 107: Hoare triple {90070#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90063#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:46,578 INFO L290 TraceCheckUtils]: 106: Hoare triple {90070#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90070#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:46,579 INFO L290 TraceCheckUtils]: 105: Hoare triple {90077#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90070#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:46,579 INFO L290 TraceCheckUtils]: 104: Hoare triple {90077#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90077#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:46,580 INFO L290 TraceCheckUtils]: 103: Hoare triple {90084#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90077#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:46,580 INFO L290 TraceCheckUtils]: 102: Hoare triple {90084#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90084#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:46,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {90091#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90084#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:46,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {90091#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90091#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:46,581 INFO L290 TraceCheckUtils]: 99: Hoare triple {90098#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90091#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:46,582 INFO L290 TraceCheckUtils]: 98: Hoare triple {90098#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90098#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:46,582 INFO L290 TraceCheckUtils]: 97: Hoare triple {90105#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90098#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:46,583 INFO L290 TraceCheckUtils]: 96: Hoare triple {90105#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90105#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:46,583 INFO L290 TraceCheckUtils]: 95: Hoare triple {90112#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90105#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:46,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {90112#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90112#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:46,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {90119#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90112#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:46,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {90119#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90119#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:46,585 INFO L290 TraceCheckUtils]: 91: Hoare triple {90126#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90119#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:46,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {90126#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90126#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:46,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {90133#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90126#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:46,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {90133#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90133#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:46,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {90140#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90133#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:46,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {90140#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90140#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:46,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {90147#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90140#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:46,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {90147#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90147#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:46,589 INFO L290 TraceCheckUtils]: 83: Hoare triple {90154#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90147#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:46,589 INFO L290 TraceCheckUtils]: 82: Hoare triple {90154#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90154#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:46,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {90161#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90154#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:46,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {90161#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90161#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:46,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {90168#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90161#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:46,591 INFO L290 TraceCheckUtils]: 78: Hoare triple {90168#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90168#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:46,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {90175#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90168#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:46,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {90175#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90175#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:46,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {90182#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90175#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:46,592 INFO L290 TraceCheckUtils]: 74: Hoare triple {90182#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90182#(< main_~i~0 999)} is VALID [2022-04-15 06:03:46,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {90189#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90182#(< main_~i~0 999)} is VALID [2022-04-15 06:03:46,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {90189#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90189#(< main_~i~0 998)} is VALID [2022-04-15 06:03:46,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {90196#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90189#(< main_~i~0 998)} is VALID [2022-04-15 06:03:46,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {90196#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90196#(< main_~i~0 997)} is VALID [2022-04-15 06:03:46,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {90203#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90196#(< main_~i~0 997)} is VALID [2022-04-15 06:03:46,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {90203#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90203#(< main_~i~0 996)} is VALID [2022-04-15 06:03:46,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {90210#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90203#(< main_~i~0 996)} is VALID [2022-04-15 06:03:46,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {90210#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90210#(< main_~i~0 995)} is VALID [2022-04-15 06:03:46,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {90217#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90210#(< main_~i~0 995)} is VALID [2022-04-15 06:03:46,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {90217#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90217#(< main_~i~0 994)} is VALID [2022-04-15 06:03:46,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {90224#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90217#(< main_~i~0 994)} is VALID [2022-04-15 06:03:46,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {90224#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90224#(< main_~i~0 993)} is VALID [2022-04-15 06:03:46,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {90231#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90224#(< main_~i~0 993)} is VALID [2022-04-15 06:03:46,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {90231#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90231#(< main_~i~0 992)} is VALID [2022-04-15 06:03:46,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {90238#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90231#(< main_~i~0 992)} is VALID [2022-04-15 06:03:46,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {90238#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90238#(< main_~i~0 991)} is VALID [2022-04-15 06:03:46,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {90245#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90238#(< main_~i~0 991)} is VALID [2022-04-15 06:03:46,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {90245#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90245#(< main_~i~0 990)} is VALID [2022-04-15 06:03:46,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {90252#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90245#(< main_~i~0 990)} is VALID [2022-04-15 06:03:46,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {90252#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90252#(< main_~i~0 989)} is VALID [2022-04-15 06:03:46,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {90259#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90252#(< main_~i~0 989)} is VALID [2022-04-15 06:03:46,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {90259#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90259#(< main_~i~0 988)} is VALID [2022-04-15 06:03:46,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {90266#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90259#(< main_~i~0 988)} is VALID [2022-04-15 06:03:46,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {90266#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90266#(< main_~i~0 987)} is VALID [2022-04-15 06:03:46,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {90273#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90266#(< main_~i~0 987)} is VALID [2022-04-15 06:03:46,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {90273#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90273#(< main_~i~0 986)} is VALID [2022-04-15 06:03:46,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {90280#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90273#(< main_~i~0 986)} is VALID [2022-04-15 06:03:46,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {90280#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90280#(< main_~i~0 985)} is VALID [2022-04-15 06:03:46,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {90287#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90280#(< main_~i~0 985)} is VALID [2022-04-15 06:03:46,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {90287#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90287#(< main_~i~0 984)} is VALID [2022-04-15 06:03:46,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {90294#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90287#(< main_~i~0 984)} is VALID [2022-04-15 06:03:46,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {90294#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90294#(< main_~i~0 983)} is VALID [2022-04-15 06:03:46,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {90301#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90294#(< main_~i~0 983)} is VALID [2022-04-15 06:03:46,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {90301#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90301#(< main_~i~0 982)} is VALID [2022-04-15 06:03:46,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {90308#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90301#(< main_~i~0 982)} is VALID [2022-04-15 06:03:46,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {90308#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90308#(< main_~i~0 981)} is VALID [2022-04-15 06:03:46,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {90315#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90308#(< main_~i~0 981)} is VALID [2022-04-15 06:03:46,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {90315#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90315#(< main_~i~0 980)} is VALID [2022-04-15 06:03:46,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {90322#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90315#(< main_~i~0 980)} is VALID [2022-04-15 06:03:46,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {90322#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90322#(< main_~i~0 979)} is VALID [2022-04-15 06:03:46,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {90329#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90322#(< main_~i~0 979)} is VALID [2022-04-15 06:03:46,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {90329#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90329#(< main_~i~0 978)} is VALID [2022-04-15 06:03:46,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {90336#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90329#(< main_~i~0 978)} is VALID [2022-04-15 06:03:46,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {90336#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90336#(< main_~i~0 977)} is VALID [2022-04-15 06:03:46,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {90343#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90336#(< main_~i~0 977)} is VALID [2022-04-15 06:03:46,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {90343#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90343#(< main_~i~0 976)} is VALID [2022-04-15 06:03:46,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {90350#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90343#(< main_~i~0 976)} is VALID [2022-04-15 06:03:46,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {90350#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90350#(< main_~i~0 975)} is VALID [2022-04-15 06:03:46,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {90357#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90350#(< main_~i~0 975)} is VALID [2022-04-15 06:03:46,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {90357#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90357#(< main_~i~0 974)} is VALID [2022-04-15 06:03:46,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {90364#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90357#(< main_~i~0 974)} is VALID [2022-04-15 06:03:46,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {90364#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90364#(< main_~i~0 973)} is VALID [2022-04-15 06:03:46,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {90371#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90364#(< main_~i~0 973)} is VALID [2022-04-15 06:03:46,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {90371#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90371#(< main_~i~0 972)} is VALID [2022-04-15 06:03:46,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {90378#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90371#(< main_~i~0 972)} is VALID [2022-04-15 06:03:46,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {90378#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90378#(< main_~i~0 971)} is VALID [2022-04-15 06:03:46,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {90385#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90378#(< main_~i~0 971)} is VALID [2022-04-15 06:03:46,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {90385#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90385#(< main_~i~0 970)} is VALID [2022-04-15 06:03:46,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {90392#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90385#(< main_~i~0 970)} is VALID [2022-04-15 06:03:46,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {90392#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90392#(< main_~i~0 969)} is VALID [2022-04-15 06:03:46,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {90399#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90392#(< main_~i~0 969)} is VALID [2022-04-15 06:03:46,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {90399#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90399#(< main_~i~0 968)} is VALID [2022-04-15 06:03:46,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {90406#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90399#(< main_~i~0 968)} is VALID [2022-04-15 06:03:46,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {90406#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90406#(< main_~i~0 967)} is VALID [2022-04-15 06:03:46,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {90413#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90406#(< main_~i~0 967)} is VALID [2022-04-15 06:03:46,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {90413#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90413#(< main_~i~0 966)} is VALID [2022-04-15 06:03:46,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {90420#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90413#(< main_~i~0 966)} is VALID [2022-04-15 06:03:46,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {90420#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90420#(< main_~i~0 965)} is VALID [2022-04-15 06:03:46,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {89504#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {90420#(< main_~i~0 965)} is VALID [2022-04-15 06:03:46,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {89504#true} call #t~ret5 := main(); {89504#true} is VALID [2022-04-15 06:03:46,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89504#true} {89504#true} #58#return; {89504#true} is VALID [2022-04-15 06:03:46,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {89504#true} assume true; {89504#true} is VALID [2022-04-15 06:03:46,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {89504#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(10, 2); {89504#true} is VALID [2022-04-15 06:03:46,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {89504#true} call ULTIMATE.init(); {89504#true} is VALID [2022-04-15 06:03:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:03:46,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802706114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:46,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:46,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 06:03:46,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:46,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755371300] [2022-04-15 06:03:46,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755371300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:46,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:46,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:03:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415367071] [2022-04-15 06:03:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 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 136 [2022-04-15 06:03:46,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:46,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have 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:46,768 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:03:46,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:03:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:03:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 06:03:46,771 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have 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,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:00,682 INFO L93 Difference]: Finished difference Result 383 states and 442 transitions. [2022-04-15 06:04:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:04:00,682 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 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 136 [2022-04-15 06:04:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have 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,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 437 transitions. [2022-04-15 06:04:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have 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,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 437 transitions. [2022-04-15 06:04:00,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 437 transitions. [2022-04-15 06:04:01,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:01,072 INFO L225 Difference]: With dead ends: 383 [2022-04-15 06:04:01,072 INFO L226 Difference]: Without dead ends: 369 [2022-04-15 06:04:01,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 06:04:01,075 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 903 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:01,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [903 Valid, 51 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:04:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-15 06:04:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 139. [2022-04-15 06:04:02,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:02,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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:04:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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:04:02,325 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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:04:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,331 INFO L93 Difference]: Finished difference Result 369 states and 427 transitions. [2022-04-15 06:04:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-04-15 06:04:02,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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 369 states. [2022-04-15 06:04:02,332 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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 369 states. [2022-04-15 06:04:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,339 INFO L93 Difference]: Finished difference Result 369 states and 427 transitions. [2022-04-15 06:04:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 427 transitions. [2022-04-15 06:04:02,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:02,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 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:04:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-15 06:04:02,342 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2022-04-15 06:04:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:02,342 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-15 06:04:02,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 61 states have internal predecessors, (128), 2 states have call successors, (3), 3 states have 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,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-15 06:04:02,750 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:04:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-15 06:04:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 06:04:02,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:02,751 INFO L499 BasicCegarLoop]: trace histogram [59, 59, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:02,782 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:02,979 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:02,980 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1498386053, now seen corresponding path program 119 times [2022-04-15 06:04:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962137674] [2022-04-15 06:04:02,985 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:02,985 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:02,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1498386053, now seen corresponding path program 120 times [2022-04-15 06:04:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:02,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817694176] [2022-04-15 06:04:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:04,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {92409#(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(10, 2); {92344#true} is VALID [2022-04-15 06:04:04,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 06:04:04,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 06:04:04,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:04,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {92409#(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(10, 2); {92344#true} is VALID [2022-04-15 06:04:04,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 06:04:04,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 06:04:04,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 06:04:04,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92349#(= main_~i~0 0)} is VALID [2022-04-15 06:04:04,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {92349#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -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 0)} is VALID [2022-04-15 06:04:04,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {92349#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:04,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {92350#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -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 1)} is VALID [2022-04-15 06:04:04,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {92350#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:04,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {92351#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -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 2)} is VALID [2022-04-15 06:04:04,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {92351#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92352#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:04,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {92352#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -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 3)} is VALID [2022-04-15 06:04:04,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {92352#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92353#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:04,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {92353#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -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 4)} is VALID [2022-04-15 06:04:04,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {92353#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92354#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:04,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {92354#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -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 5)} is VALID [2022-04-15 06:04:04,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {92354#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92355#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:04,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {92355#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -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 6)} is VALID [2022-04-15 06:04:04,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {92355#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92356#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:04,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {92356#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -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 7)} is VALID [2022-04-15 06:04:04,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {92356#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92357#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:04,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {92357#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -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 8)} is VALID [2022-04-15 06:04:04,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {92357#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92358#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:04,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {92358#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -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 9)} is VALID [2022-04-15 06:04:04,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {92358#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92359#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:04,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {92359#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -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 10)} is VALID [2022-04-15 06:04:04,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {92359#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92360#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:04,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {92360#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -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 11)} is VALID [2022-04-15 06:04:04,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {92360#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92361#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:04,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {92361#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -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 12)} is VALID [2022-04-15 06:04:04,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {92361#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92362#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:04,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {92362#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -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 13)} is VALID [2022-04-15 06:04:04,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {92362#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92363#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:04,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {92363#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -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 14)} is VALID [2022-04-15 06:04:04,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {92363#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92364#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:04,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {92364#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -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 15)} is VALID [2022-04-15 06:04:04,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {92364#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92365#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:04,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {92365#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -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 16)} is VALID [2022-04-15 06:04:04,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {92365#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92366#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:04,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {92366#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -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 17)} is VALID [2022-04-15 06:04:04,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {92366#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92367#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:04,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {92367#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -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 18)} is VALID [2022-04-15 06:04:04,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {92367#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92368#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:04,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {92368#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -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 19)} is VALID [2022-04-15 06:04:04,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {92368#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92369#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:04,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {92369#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -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 20)} is VALID [2022-04-15 06:04:04,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {92369#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92370#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:04,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {92370#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -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 21)} is VALID [2022-04-15 06:04:04,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {92370#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92371#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:04,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {92371#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -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 22)} is VALID [2022-04-15 06:04:04,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {92371#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92372#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:04,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {92372#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -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 23)} is VALID [2022-04-15 06:04:04,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {92372#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92373#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:04,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {92373#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -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 24)} is VALID [2022-04-15 06:04:04,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {92373#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92374#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:04,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {92374#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92374#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:04,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {92374#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92375#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:04,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {92375#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92375#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:04,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {92375#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92376#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:04,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {92376#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92376#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:04,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {92376#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92377#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:04,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {92377#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92377#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:04,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {92377#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92378#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:04,707 INFO L290 TraceCheckUtils]: 64: Hoare triple {92378#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92378#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:04,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {92378#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92379#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:04,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {92379#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92379#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:04,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {92379#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92380#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:04,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {92380#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92380#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:04,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {92380#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92381#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:04,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {92381#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92381#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:04,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {92381#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92382#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:04,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {92382#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92382#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:04,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {92382#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92383#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:04,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {92383#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92383#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:04,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {92383#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92384#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:04,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {92384#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92384#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:04,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {92384#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92385#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:04,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {92385#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92385#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:04,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {92385#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92386#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:04,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {92386#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92386#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:04,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {92386#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92387#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:04,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {92387#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92387#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:04,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {92387#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92388#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:04,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {92388#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92388#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:04,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {92388#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92389#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:04,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {92389#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92389#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:04,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {92389#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92390#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:04,717 INFO L290 TraceCheckUtils]: 88: Hoare triple {92390#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92390#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:04,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {92390#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92391#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:04,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {92391#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92391#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:04,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {92391#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92392#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:04,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {92392#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92392#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:04,719 INFO L290 TraceCheckUtils]: 93: Hoare triple {92392#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92393#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:04,719 INFO L290 TraceCheckUtils]: 94: Hoare triple {92393#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92393#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:04,720 INFO L290 TraceCheckUtils]: 95: Hoare triple {92393#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92394#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:04,720 INFO L290 TraceCheckUtils]: 96: Hoare triple {92394#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92394#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:04,720 INFO L290 TraceCheckUtils]: 97: Hoare triple {92394#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92395#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:04,721 INFO L290 TraceCheckUtils]: 98: Hoare triple {92395#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92395#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:04,721 INFO L290 TraceCheckUtils]: 99: Hoare triple {92395#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92396#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:04,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {92396#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92396#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:04,722 INFO L290 TraceCheckUtils]: 101: Hoare triple {92396#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92397#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:04,722 INFO L290 TraceCheckUtils]: 102: Hoare triple {92397#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92397#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:04,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {92397#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92398#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:04,723 INFO L290 TraceCheckUtils]: 104: Hoare triple {92398#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92398#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:04,724 INFO L290 TraceCheckUtils]: 105: Hoare triple {92398#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92399#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:04,724 INFO L290 TraceCheckUtils]: 106: Hoare triple {92399#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92399#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:04,724 INFO L290 TraceCheckUtils]: 107: Hoare triple {92399#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92400#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:04,725 INFO L290 TraceCheckUtils]: 108: Hoare triple {92400#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92400#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:04,725 INFO L290 TraceCheckUtils]: 109: Hoare triple {92400#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92401#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:04,725 INFO L290 TraceCheckUtils]: 110: Hoare triple {92401#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92401#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:04,726 INFO L290 TraceCheckUtils]: 111: Hoare triple {92401#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92402#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:04,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {92402#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92402#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:04,727 INFO L290 TraceCheckUtils]: 113: Hoare triple {92402#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92403#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:04,727 INFO L290 TraceCheckUtils]: 114: Hoare triple {92403#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92403#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:04,727 INFO L290 TraceCheckUtils]: 115: Hoare triple {92403#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92404#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:04,728 INFO L290 TraceCheckUtils]: 116: Hoare triple {92404#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92404#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:04,728 INFO L290 TraceCheckUtils]: 117: Hoare triple {92404#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92405#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:04,729 INFO L290 TraceCheckUtils]: 118: Hoare triple {92405#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92405#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:04,729 INFO L290 TraceCheckUtils]: 119: Hoare triple {92405#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92406#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:04,729 INFO L290 TraceCheckUtils]: 120: Hoare triple {92406#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92406#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:04,730 INFO L290 TraceCheckUtils]: 121: Hoare triple {92406#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92407#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:04,730 INFO L290 TraceCheckUtils]: 122: Hoare triple {92407#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92407#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:04,730 INFO L290 TraceCheckUtils]: 123: Hoare triple {92407#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92408#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 124: Hoare triple {92408#(<= main_~i~0 59)} assume !(~i~0 < 1023); {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 125: Hoare triple {92345#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 126: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 127: Hoare triple {92345#false} assume !!(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 128: Hoare triple {92345#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 129: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 06:04:04,731 INFO L290 TraceCheckUtils]: 130: Hoare triple {92345#false} assume !!(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 131: Hoare triple {92345#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 132: Hoare triple {92345#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 133: Hoare triple {92345#false} assume !(0 != #t~mem4);havoc #t~mem4; {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L272 TraceCheckUtils]: 134: Hoare triple {92345#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 135: Hoare triple {92345#false} ~cond := #in~cond; {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 136: Hoare triple {92345#false} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 06:04:04,732 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 06:04:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817694176] [2022-04-15 06:04:04,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817694176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379835457] [2022-04-15 06:04:04,733 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:04:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:04,734 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:04,736 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:05,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:04:05,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:05,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:04:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:05,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:05,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#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(10, 2); {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92344#true} is VALID [2022-04-15 06:04:05,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 54: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 71: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 72: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 80: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 84: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 86: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 87: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 88: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 90: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 91: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 92: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 94: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 95: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 97: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 98: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 99: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 100: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 101: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 102: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 103: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 105: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 106: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 107: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,605 INFO L290 TraceCheckUtils]: 108: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 109: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 110: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 111: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 112: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 113: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 114: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 115: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 116: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 117: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,606 INFO L290 TraceCheckUtils]: 118: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 119: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 120: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 121: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 122: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 123: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:05,607 INFO L290 TraceCheckUtils]: 124: Hoare triple {92344#true} assume !(~i~0 < 1023); {92344#true} is VALID [2022-04-15 06:04:05,608 INFO L290 TraceCheckUtils]: 125: Hoare triple {92344#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92788#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:05,608 INFO L290 TraceCheckUtils]: 126: Hoare triple {92788#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92788#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:05,608 INFO L290 TraceCheckUtils]: 127: Hoare triple {92788#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {92788#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:05,609 INFO L290 TraceCheckUtils]: 128: Hoare triple {92788#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:05,609 INFO L290 TraceCheckUtils]: 129: Hoare triple {92350#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92350#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:05,609 INFO L290 TraceCheckUtils]: 130: Hoare triple {92350#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {92350#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:05,610 INFO L290 TraceCheckUtils]: 131: Hoare triple {92350#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:05,610 INFO L290 TraceCheckUtils]: 132: Hoare triple {92351#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92351#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:05,611 INFO L290 TraceCheckUtils]: 133: Hoare triple {92351#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {92351#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:05,611 INFO L272 TraceCheckUtils]: 134: Hoare triple {92351#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:05,612 INFO L290 TraceCheckUtils]: 135: Hoare triple {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:04:05,612 INFO L290 TraceCheckUtils]: 136: Hoare triple {92820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 06:04:05,612 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 06:04:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 06:04:05,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:05,999 INFO L290 TraceCheckUtils]: 137: Hoare triple {92345#false} assume !false; {92345#false} is VALID [2022-04-15 06:04:05,999 INFO L290 TraceCheckUtils]: 136: Hoare triple {92820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92345#false} is VALID [2022-04-15 06:04:06,000 INFO L290 TraceCheckUtils]: 135: Hoare triple {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:04:06,000 INFO L272 TraceCheckUtils]: 134: Hoare triple {92836#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {92816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:06,000 INFO L290 TraceCheckUtils]: 133: Hoare triple {92836#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 06:04:06,001 INFO L290 TraceCheckUtils]: 132: Hoare triple {92836#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 06:04:06,001 INFO L290 TraceCheckUtils]: 131: Hoare triple {92846#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92836#(<= main_~i~0 1024)} is VALID [2022-04-15 06:04:06,001 INFO L290 TraceCheckUtils]: 130: Hoare triple {92846#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 06:04:06,002 INFO L290 TraceCheckUtils]: 129: Hoare triple {92846#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 06:04:06,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {92856#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92846#(<= main_~i~0 1023)} is VALID [2022-04-15 06:04:06,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {92856#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 126: Hoare triple {92856#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 125: Hoare triple {92344#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {92856#(<= main_~i~0 1022)} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 124: Hoare triple {92344#true} assume !(~i~0 < 1023); {92344#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 123: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 122: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 121: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 120: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 119: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,003 INFO L290 TraceCheckUtils]: 118: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 117: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 116: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 115: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 114: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 113: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 112: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 111: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 110: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 109: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 108: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 107: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 106: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 105: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,004 INFO L290 TraceCheckUtils]: 104: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 103: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 102: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 101: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 100: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 99: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 98: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 97: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 95: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,005 INFO L290 TraceCheckUtils]: 89: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 87: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 86: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 85: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 84: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 83: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 81: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 80: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 77: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 55: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {92344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {92344#true} assume !!(~i~0 < 1023);assume -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#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {92344#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {92344#true} call #t~ret5 := main(); {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92344#true} {92344#true} #58#return; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {92344#true} assume true; {92344#true} is VALID [2022-04-15 06:04:06,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {92344#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(10, 2); {92344#true} is VALID [2022-04-15 06:04:06,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {92344#true} call ULTIMATE.init(); {92344#true} is VALID [2022-04-15 06:04:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 06:04:06,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379835457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:06,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:06,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 7, 7] total 69 [2022-04-15 06:04:06,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:06,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962137674] [2022-04-15 06:04:06,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962137674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:06,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:06,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:04:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427861541] [2022-04-15 06:04:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 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 138 [2022-04-15 06:04:06,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:06,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have 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:06,101 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:04:06,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:04:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:04:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2151, Invalid=2541, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:04:06,102 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have 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:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:19,708 INFO L93 Difference]: Finished difference Result 389 states and 449 transitions. [2022-04-15 06:04:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:04:19,708 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 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 138 [2022-04-15 06:04:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have 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:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 444 transitions. [2022-04-15 06:04:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have 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:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 444 transitions. [2022-04-15 06:04:19,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 444 transitions. [2022-04-15 06:04:20,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:20,034 INFO L225 Difference]: With dead ends: 389 [2022-04-15 06:04:20,034 INFO L226 Difference]: Without dead ends: 375 [2022-04-15 06:04:20,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=6112, Invalid=10400, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 06:04:20,035 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 950 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:20,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 51 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:04:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-15 06:04:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 141. [2022-04-15 06:04:21,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:21,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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:21,023 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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:21,023 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:21,028 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2022-04-15 06:04:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 434 transitions. [2022-04-15 06:04:21,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:21,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:21,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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 375 states. [2022-04-15 06:04:21,028 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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 375 states. [2022-04-15 06:04:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:21,033 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2022-04-15 06:04:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 434 transitions. [2022-04-15 06:04:21,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:21,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:21,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:21,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 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:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2022-04-15 06:04:21,035 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2022-04-15 06:04:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:21,035 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2022-04-15 06:04:21,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have 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:21,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 142 transitions. [2022-04-15 06:04:21,392 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:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2022-04-15 06:04:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 06:04:21,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:21,393 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:21,412 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:04:21,595 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:04:21,595 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -627392473, now seen corresponding path program 121 times [2022-04-15 06:04:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:21,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1162845006] [2022-04-15 06:04:21,599 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:21,599 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:21,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -627392473, now seen corresponding path program 122 times [2022-04-15 06:04:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:21,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386509813] [2022-04-15 06:04:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:22,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {95239#(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(10, 2); {95173#true} is VALID [2022-04-15 06:04:22,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 06:04:22,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 06:04:22,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:22,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {95239#(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(10, 2); {95173#true} is VALID [2022-04-15 06:04:22,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 06:04:22,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 06:04:22,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 06:04:22,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95178#(= main_~i~0 0)} is VALID [2022-04-15 06:04:22,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {95178#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95178#(= main_~i~0 0)} is VALID [2022-04-15 06:04:22,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {95178#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:22,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {95179#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:22,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {95179#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:22,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {95180#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:22,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {95180#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:23,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {95181#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:23,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {95181#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:23,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {95182#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:23,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {95182#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:23,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {95183#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:23,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {95183#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:23,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {95184#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:23,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {95184#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:23,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {95185#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:23,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {95185#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:23,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {95186#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:23,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {95186#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:23,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {95187#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:23,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {95187#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:23,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {95188#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:23,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {95188#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:23,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {95189#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:23,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {95189#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:23,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {95190#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:23,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {95190#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:23,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {95191#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:23,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {95191#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:23,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {95192#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:23,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {95192#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:23,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {95193#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:23,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {95193#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:23,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {95194#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:23,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {95194#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:23,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {95195#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:23,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {95195#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:23,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {95196#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:23,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {95196#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:23,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {95197#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:23,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {95197#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:23,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {95198#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:23,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {95198#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:23,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {95199#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:23,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {95199#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:23,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {95200#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:23,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {95200#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:23,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {95201#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:23,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {95201#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:23,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {95202#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:23,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {95202#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:23,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {95203#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:23,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {95203#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:23,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {95204#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:23,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {95204#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:23,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {95205#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:23,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {95205#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:23,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {95206#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:23,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {95206#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:23,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {95207#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:23,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {95207#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:23,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {95208#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:23,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {95208#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:23,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {95209#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:23,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {95209#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:23,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {95210#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:23,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {95210#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:23,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {95211#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:23,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {95211#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:23,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {95212#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:23,021 INFO L290 TraceCheckUtils]: 75: Hoare triple {95212#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:23,021 INFO L290 TraceCheckUtils]: 76: Hoare triple {95213#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:23,021 INFO L290 TraceCheckUtils]: 77: Hoare triple {95213#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:23,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {95214#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:23,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {95214#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:23,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {95215#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:23,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {95215#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:23,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {95216#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:23,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {95216#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:23,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {95217#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:23,024 INFO L290 TraceCheckUtils]: 85: Hoare triple {95217#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:23,024 INFO L290 TraceCheckUtils]: 86: Hoare triple {95218#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:23,024 INFO L290 TraceCheckUtils]: 87: Hoare triple {95218#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:23,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {95219#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:23,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {95219#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:23,025 INFO L290 TraceCheckUtils]: 90: Hoare triple {95220#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:23,026 INFO L290 TraceCheckUtils]: 91: Hoare triple {95220#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:23,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {95221#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:23,026 INFO L290 TraceCheckUtils]: 93: Hoare triple {95221#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:23,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {95222#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:23,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {95222#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:23,027 INFO L290 TraceCheckUtils]: 96: Hoare triple {95223#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:23,028 INFO L290 TraceCheckUtils]: 97: Hoare triple {95223#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:23,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {95224#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:23,028 INFO L290 TraceCheckUtils]: 99: Hoare triple {95224#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:23,029 INFO L290 TraceCheckUtils]: 100: Hoare triple {95225#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:23,029 INFO L290 TraceCheckUtils]: 101: Hoare triple {95225#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:23,029 INFO L290 TraceCheckUtils]: 102: Hoare triple {95226#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:23,030 INFO L290 TraceCheckUtils]: 103: Hoare triple {95226#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:23,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {95227#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:23,030 INFO L290 TraceCheckUtils]: 105: Hoare triple {95227#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:23,031 INFO L290 TraceCheckUtils]: 106: Hoare triple {95228#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:23,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {95228#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:23,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {95229#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:23,032 INFO L290 TraceCheckUtils]: 109: Hoare triple {95229#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:23,032 INFO L290 TraceCheckUtils]: 110: Hoare triple {95230#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:23,032 INFO L290 TraceCheckUtils]: 111: Hoare triple {95230#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:23,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {95231#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:23,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {95231#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:23,033 INFO L290 TraceCheckUtils]: 114: Hoare triple {95232#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:23,034 INFO L290 TraceCheckUtils]: 115: Hoare triple {95232#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:23,034 INFO L290 TraceCheckUtils]: 116: Hoare triple {95233#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:23,034 INFO L290 TraceCheckUtils]: 117: Hoare triple {95233#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:23,035 INFO L290 TraceCheckUtils]: 118: Hoare triple {95234#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:23,035 INFO L290 TraceCheckUtils]: 119: Hoare triple {95234#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:23,035 INFO L290 TraceCheckUtils]: 120: Hoare triple {95235#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:23,036 INFO L290 TraceCheckUtils]: 121: Hoare triple {95235#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:23,036 INFO L290 TraceCheckUtils]: 122: Hoare triple {95236#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:23,036 INFO L290 TraceCheckUtils]: 123: Hoare triple {95236#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 124: Hoare triple {95237#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 125: Hoare triple {95237#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95238#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 126: Hoare triple {95238#(<= main_~i~0 60)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:23,037 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 06:04:23,038 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 06:04:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386509813] [2022-04-15 06:04:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386509813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899637179] [2022-04-15 06:04:23,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:23,040 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:04:23,041 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:04:23,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:23,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:23,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-15 06:04:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:23,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:24,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95173#true} is VALID [2022-04-15 06:04:24,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#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(10, 2); {95173#true} is VALID [2022-04-15 06:04:24,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 06:04:24,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 06:04:24,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 06:04:24,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95258#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:24,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {95258#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95258#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:24,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {95258#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:24,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {95179#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95179#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:24,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {95179#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:24,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {95180#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95180#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:24,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {95180#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:24,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {95181#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95181#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:24,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {95181#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:24,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {95182#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95182#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:24,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {95182#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:24,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {95183#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95183#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:24,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {95183#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:24,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {95184#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95184#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:24,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {95184#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:24,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {95185#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95185#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:24,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {95185#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:24,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {95186#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95186#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:24,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {95186#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:24,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {95187#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95187#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:24,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {95187#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:24,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {95188#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95188#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:24,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {95188#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:24,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {95189#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95189#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:24,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {95189#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:24,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {95190#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95190#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:24,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {95190#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:24,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {95191#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95191#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:24,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {95191#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:24,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {95192#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95192#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:24,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {95192#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:24,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {95193#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95193#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:24,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {95193#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:24,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {95194#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95194#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:24,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {95194#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:24,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {95195#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95195#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:24,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {95195#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:24,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {95196#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95196#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:24,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {95196#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:24,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {95197#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95197#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:24,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {95197#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:24,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {95198#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95198#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:24,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {95198#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:24,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {95199#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95199#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:24,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {95199#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:24,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {95200#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95200#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:24,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {95200#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:24,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {95201#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95201#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:24,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {95201#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:24,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {95202#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95202#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:24,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {95202#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:24,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {95203#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95203#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:24,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {95203#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:24,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {95204#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95204#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:24,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {95204#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:24,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {95205#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95205#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:24,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {95205#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:24,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {95206#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95206#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:24,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {95206#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:24,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {95207#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95207#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:24,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {95207#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:24,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {95208#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95208#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:24,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {95208#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:24,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {95209#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95209#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:24,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {95209#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:24,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {95210#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95210#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:24,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {95210#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:24,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {95211#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95211#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:24,309 INFO L290 TraceCheckUtils]: 73: Hoare triple {95211#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:24,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {95212#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95212#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:24,309 INFO L290 TraceCheckUtils]: 75: Hoare triple {95212#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:24,310 INFO L290 TraceCheckUtils]: 76: Hoare triple {95213#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95213#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:24,310 INFO L290 TraceCheckUtils]: 77: Hoare triple {95213#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:24,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {95214#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95214#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:24,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {95214#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:24,311 INFO L290 TraceCheckUtils]: 80: Hoare triple {95215#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95215#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:24,311 INFO L290 TraceCheckUtils]: 81: Hoare triple {95215#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:24,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {95216#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95216#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:24,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {95216#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:24,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {95217#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95217#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:24,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {95217#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:24,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {95218#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95218#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:24,313 INFO L290 TraceCheckUtils]: 87: Hoare triple {95218#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:24,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {95219#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95219#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:24,314 INFO L290 TraceCheckUtils]: 89: Hoare triple {95219#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:24,314 INFO L290 TraceCheckUtils]: 90: Hoare triple {95220#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95220#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:24,315 INFO L290 TraceCheckUtils]: 91: Hoare triple {95220#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:24,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {95221#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95221#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:24,315 INFO L290 TraceCheckUtils]: 93: Hoare triple {95221#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:24,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {95222#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95222#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:24,316 INFO L290 TraceCheckUtils]: 95: Hoare triple {95222#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:24,316 INFO L290 TraceCheckUtils]: 96: Hoare triple {95223#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95223#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:24,317 INFO L290 TraceCheckUtils]: 97: Hoare triple {95223#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:24,317 INFO L290 TraceCheckUtils]: 98: Hoare triple {95224#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95224#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:24,317 INFO L290 TraceCheckUtils]: 99: Hoare triple {95224#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:24,318 INFO L290 TraceCheckUtils]: 100: Hoare triple {95225#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95225#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:24,318 INFO L290 TraceCheckUtils]: 101: Hoare triple {95225#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:24,318 INFO L290 TraceCheckUtils]: 102: Hoare triple {95226#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95226#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:24,319 INFO L290 TraceCheckUtils]: 103: Hoare triple {95226#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:24,319 INFO L290 TraceCheckUtils]: 104: Hoare triple {95227#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95227#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:24,319 INFO L290 TraceCheckUtils]: 105: Hoare triple {95227#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:24,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {95228#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95228#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:24,320 INFO L290 TraceCheckUtils]: 107: Hoare triple {95228#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:24,320 INFO L290 TraceCheckUtils]: 108: Hoare triple {95229#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95229#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:24,321 INFO L290 TraceCheckUtils]: 109: Hoare triple {95229#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:24,321 INFO L290 TraceCheckUtils]: 110: Hoare triple {95230#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95230#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:24,321 INFO L290 TraceCheckUtils]: 111: Hoare triple {95230#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:24,321 INFO L290 TraceCheckUtils]: 112: Hoare triple {95231#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95231#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:24,322 INFO L290 TraceCheckUtils]: 113: Hoare triple {95231#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:24,322 INFO L290 TraceCheckUtils]: 114: Hoare triple {95232#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95232#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:24,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {95232#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:24,323 INFO L290 TraceCheckUtils]: 116: Hoare triple {95233#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95233#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:24,323 INFO L290 TraceCheckUtils]: 117: Hoare triple {95233#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:24,323 INFO L290 TraceCheckUtils]: 118: Hoare triple {95234#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95234#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:24,324 INFO L290 TraceCheckUtils]: 119: Hoare triple {95234#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:24,324 INFO L290 TraceCheckUtils]: 120: Hoare triple {95235#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95235#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:24,324 INFO L290 TraceCheckUtils]: 121: Hoare triple {95235#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:24,325 INFO L290 TraceCheckUtils]: 122: Hoare triple {95236#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95236#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:24,325 INFO L290 TraceCheckUtils]: 123: Hoare triple {95236#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:24,325 INFO L290 TraceCheckUtils]: 124: Hoare triple {95237#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95237#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 125: Hoare triple {95237#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95238#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 126: Hoare triple {95238#(<= main_~i~0 60)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:24,326 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 06:04:24,327 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 06:04:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:24,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 139: Hoare triple {95174#false} assume !false; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 138: Hoare triple {95174#false} assume 0 == ~cond; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 137: Hoare triple {95174#false} ~cond := #in~cond; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L272 TraceCheckUtils]: 136: Hoare triple {95174#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 135: Hoare triple {95174#false} assume !(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 134: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 133: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 132: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:28,562 INFO L290 TraceCheckUtils]: 131: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:28,563 INFO L290 TraceCheckUtils]: 130: Hoare triple {95174#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95174#false} is VALID [2022-04-15 06:04:28,563 INFO L290 TraceCheckUtils]: 129: Hoare triple {95174#false} assume !!(0 != #t~mem4);havoc #t~mem4; {95174#false} is VALID [2022-04-15 06:04:28,563 INFO L290 TraceCheckUtils]: 128: Hoare triple {95174#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {95174#false} is VALID [2022-04-15 06:04:28,563 INFO L290 TraceCheckUtils]: 127: Hoare triple {95174#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {95174#false} is VALID [2022-04-15 06:04:28,563 INFO L290 TraceCheckUtils]: 126: Hoare triple {95700#(< main_~i~0 1023)} assume !(~i~0 < 1023); {95174#false} is VALID [2022-04-15 06:04:28,564 INFO L290 TraceCheckUtils]: 125: Hoare triple {95704#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95700#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:28,564 INFO L290 TraceCheckUtils]: 124: Hoare triple {95704#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95704#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:28,564 INFO L290 TraceCheckUtils]: 123: Hoare triple {95711#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95704#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:28,564 INFO L290 TraceCheckUtils]: 122: Hoare triple {95711#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95711#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:28,565 INFO L290 TraceCheckUtils]: 121: Hoare triple {95718#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95711#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:28,565 INFO L290 TraceCheckUtils]: 120: Hoare triple {95718#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95718#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:28,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {95725#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95718#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:28,566 INFO L290 TraceCheckUtils]: 118: Hoare triple {95725#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95725#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:28,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {95732#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95725#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:28,566 INFO L290 TraceCheckUtils]: 116: Hoare triple {95732#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95732#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:28,567 INFO L290 TraceCheckUtils]: 115: Hoare triple {95739#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95732#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:28,567 INFO L290 TraceCheckUtils]: 114: Hoare triple {95739#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95739#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:28,568 INFO L290 TraceCheckUtils]: 113: Hoare triple {95746#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95739#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:28,568 INFO L290 TraceCheckUtils]: 112: Hoare triple {95746#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95746#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:28,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {95753#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95746#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:28,568 INFO L290 TraceCheckUtils]: 110: Hoare triple {95753#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95753#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:28,569 INFO L290 TraceCheckUtils]: 109: Hoare triple {95760#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95753#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:28,569 INFO L290 TraceCheckUtils]: 108: Hoare triple {95760#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95760#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:28,570 INFO L290 TraceCheckUtils]: 107: Hoare triple {95767#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95760#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:28,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {95767#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95767#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:28,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {95774#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95767#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:28,570 INFO L290 TraceCheckUtils]: 104: Hoare triple {95774#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95774#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:28,571 INFO L290 TraceCheckUtils]: 103: Hoare triple {95781#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95774#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:28,571 INFO L290 TraceCheckUtils]: 102: Hoare triple {95781#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95781#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:28,572 INFO L290 TraceCheckUtils]: 101: Hoare triple {95788#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95781#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:28,572 INFO L290 TraceCheckUtils]: 100: Hoare triple {95788#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95788#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:28,572 INFO L290 TraceCheckUtils]: 99: Hoare triple {95795#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95788#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:28,572 INFO L290 TraceCheckUtils]: 98: Hoare triple {95795#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95795#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:28,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {95802#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95795#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:28,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {95802#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95802#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:28,574 INFO L290 TraceCheckUtils]: 95: Hoare triple {95809#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95802#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:28,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {95809#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95809#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:28,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {95816#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95809#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:28,574 INFO L290 TraceCheckUtils]: 92: Hoare triple {95816#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95816#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:28,575 INFO L290 TraceCheckUtils]: 91: Hoare triple {95823#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95816#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:28,575 INFO L290 TraceCheckUtils]: 90: Hoare triple {95823#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95823#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:28,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {95830#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95823#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:28,576 INFO L290 TraceCheckUtils]: 88: Hoare triple {95830#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95830#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:28,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {95837#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95830#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:28,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {95837#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95837#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:28,577 INFO L290 TraceCheckUtils]: 85: Hoare triple {95844#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95837#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:28,577 INFO L290 TraceCheckUtils]: 84: Hoare triple {95844#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95844#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:28,577 INFO L290 TraceCheckUtils]: 83: Hoare triple {95851#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95844#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:28,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {95851#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95851#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:28,578 INFO L290 TraceCheckUtils]: 81: Hoare triple {95858#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95851#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:28,578 INFO L290 TraceCheckUtils]: 80: Hoare triple {95858#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95858#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:28,579 INFO L290 TraceCheckUtils]: 79: Hoare triple {95865#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95858#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:28,579 INFO L290 TraceCheckUtils]: 78: Hoare triple {95865#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95865#(< main_~i~0 999)} is VALID [2022-04-15 06:04:28,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {95872#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95865#(< main_~i~0 999)} is VALID [2022-04-15 06:04:28,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {95872#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95872#(< main_~i~0 998)} is VALID [2022-04-15 06:04:28,580 INFO L290 TraceCheckUtils]: 75: Hoare triple {95879#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95872#(< main_~i~0 998)} is VALID [2022-04-15 06:04:28,580 INFO L290 TraceCheckUtils]: 74: Hoare triple {95879#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95879#(< main_~i~0 997)} is VALID [2022-04-15 06:04:28,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {95886#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95879#(< main_~i~0 997)} is VALID [2022-04-15 06:04:28,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {95886#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95886#(< main_~i~0 996)} is VALID [2022-04-15 06:04:28,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {95893#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95886#(< main_~i~0 996)} is VALID [2022-04-15 06:04:28,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {95893#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95893#(< main_~i~0 995)} is VALID [2022-04-15 06:04:28,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {95900#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95893#(< main_~i~0 995)} is VALID [2022-04-15 06:04:28,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {95900#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95900#(< main_~i~0 994)} is VALID [2022-04-15 06:04:28,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {95907#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95900#(< main_~i~0 994)} is VALID [2022-04-15 06:04:28,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {95907#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95907#(< main_~i~0 993)} is VALID [2022-04-15 06:04:28,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {95914#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95907#(< main_~i~0 993)} is VALID [2022-04-15 06:04:28,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {95914#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95914#(< main_~i~0 992)} is VALID [2022-04-15 06:04:28,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {95921#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95914#(< main_~i~0 992)} is VALID [2022-04-15 06:04:28,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {95921#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95921#(< main_~i~0 991)} is VALID [2022-04-15 06:04:28,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {95928#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95921#(< main_~i~0 991)} is VALID [2022-04-15 06:04:28,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {95928#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95928#(< main_~i~0 990)} is VALID [2022-04-15 06:04:28,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {95935#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95928#(< main_~i~0 990)} is VALID [2022-04-15 06:04:28,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {95935#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95935#(< main_~i~0 989)} is VALID [2022-04-15 06:04:28,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {95942#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95935#(< main_~i~0 989)} is VALID [2022-04-15 06:04:28,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {95942#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95942#(< main_~i~0 988)} is VALID [2022-04-15 06:04:28,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {95949#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95942#(< main_~i~0 988)} is VALID [2022-04-15 06:04:28,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {95949#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95949#(< main_~i~0 987)} is VALID [2022-04-15 06:04:28,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {95956#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95949#(< main_~i~0 987)} is VALID [2022-04-15 06:04:28,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {95956#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95956#(< main_~i~0 986)} is VALID [2022-04-15 06:04:28,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {95963#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95956#(< main_~i~0 986)} is VALID [2022-04-15 06:04:28,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {95963#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95963#(< main_~i~0 985)} is VALID [2022-04-15 06:04:28,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {95970#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95963#(< main_~i~0 985)} is VALID [2022-04-15 06:04:28,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {95970#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95970#(< main_~i~0 984)} is VALID [2022-04-15 06:04:28,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {95977#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95970#(< main_~i~0 984)} is VALID [2022-04-15 06:04:28,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {95977#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95977#(< main_~i~0 983)} is VALID [2022-04-15 06:04:28,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {95984#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95977#(< main_~i~0 983)} is VALID [2022-04-15 06:04:28,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {95984#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95984#(< main_~i~0 982)} is VALID [2022-04-15 06:04:28,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {95991#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95984#(< main_~i~0 982)} is VALID [2022-04-15 06:04:28,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {95991#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95991#(< main_~i~0 981)} is VALID [2022-04-15 06:04:28,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {95998#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95991#(< main_~i~0 981)} is VALID [2022-04-15 06:04:28,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {95998#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95998#(< main_~i~0 980)} is VALID [2022-04-15 06:04:28,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {96005#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95998#(< main_~i~0 980)} is VALID [2022-04-15 06:04:28,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {96005#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96005#(< main_~i~0 979)} is VALID [2022-04-15 06:04:28,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {96012#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96005#(< main_~i~0 979)} is VALID [2022-04-15 06:04:28,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {96012#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96012#(< main_~i~0 978)} is VALID [2022-04-15 06:04:28,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {96019#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96012#(< main_~i~0 978)} is VALID [2022-04-15 06:04:28,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {96019#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96019#(< main_~i~0 977)} is VALID [2022-04-15 06:04:28,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {96026#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96019#(< main_~i~0 977)} is VALID [2022-04-15 06:04:28,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {96026#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96026#(< main_~i~0 976)} is VALID [2022-04-15 06:04:28,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {96033#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96026#(< main_~i~0 976)} is VALID [2022-04-15 06:04:28,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {96033#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96033#(< main_~i~0 975)} is VALID [2022-04-15 06:04:28,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {96040#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96033#(< main_~i~0 975)} is VALID [2022-04-15 06:04:28,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {96040#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96040#(< main_~i~0 974)} is VALID [2022-04-15 06:04:28,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {96047#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96040#(< main_~i~0 974)} is VALID [2022-04-15 06:04:28,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {96047#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96047#(< main_~i~0 973)} is VALID [2022-04-15 06:04:28,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {96054#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96047#(< main_~i~0 973)} is VALID [2022-04-15 06:04:28,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {96054#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96054#(< main_~i~0 972)} is VALID [2022-04-15 06:04:28,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {96061#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96054#(< main_~i~0 972)} is VALID [2022-04-15 06:04:28,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {96061#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96061#(< main_~i~0 971)} is VALID [2022-04-15 06:04:28,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {96068#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96061#(< main_~i~0 971)} is VALID [2022-04-15 06:04:28,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {96068#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96068#(< main_~i~0 970)} is VALID [2022-04-15 06:04:28,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {96075#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96068#(< main_~i~0 970)} is VALID [2022-04-15 06:04:28,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {96075#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96075#(< main_~i~0 969)} is VALID [2022-04-15 06:04:28,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {96082#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96075#(< main_~i~0 969)} is VALID [2022-04-15 06:04:28,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {96082#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96082#(< main_~i~0 968)} is VALID [2022-04-15 06:04:28,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {96089#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96082#(< main_~i~0 968)} is VALID [2022-04-15 06:04:28,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {96089#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96089#(< main_~i~0 967)} is VALID [2022-04-15 06:04:28,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {96096#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96089#(< main_~i~0 967)} is VALID [2022-04-15 06:04:28,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {96096#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96096#(< main_~i~0 966)} is VALID [2022-04-15 06:04:28,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {96103#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96096#(< main_~i~0 966)} is VALID [2022-04-15 06:04:28,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {96103#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96103#(< main_~i~0 965)} is VALID [2022-04-15 06:04:28,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {96110#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96103#(< main_~i~0 965)} is VALID [2022-04-15 06:04:28,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {96110#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96110#(< main_~i~0 964)} is VALID [2022-04-15 06:04:28,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {96117#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96110#(< main_~i~0 964)} is VALID [2022-04-15 06:04:28,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {96117#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96117#(< main_~i~0 963)} is VALID [2022-04-15 06:04:28,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {95173#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {96117#(< main_~i~0 963)} is VALID [2022-04-15 06:04:28,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {95173#true} call #t~ret5 := main(); {95173#true} is VALID [2022-04-15 06:04:28,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95173#true} {95173#true} #58#return; {95173#true} is VALID [2022-04-15 06:04:28,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {95173#true} assume true; {95173#true} is VALID [2022-04-15 06:04:28,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {95173#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(10, 2); {95173#true} is VALID [2022-04-15 06:04:28,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {95173#true} call ULTIMATE.init(); {95173#true} is VALID [2022-04-15 06:04:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3607 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899637179] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:28,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:28,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-15 06:04:28,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:28,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1162845006] [2022-04-15 06:04:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1162845006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:28,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:28,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:04:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408329982] [2022-04-15 06:04:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 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 140 [2022-04-15 06:04:28,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:28,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have 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:28,693 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:04:28,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:04:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:04:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-15 06:04:28,696 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have 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:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:42,648 INFO L93 Difference]: Finished difference Result 395 states and 456 transitions. [2022-04-15 06:04:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:04:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 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 140 [2022-04-15 06:04:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have 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:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 451 transitions. [2022-04-15 06:04:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have 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:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 451 transitions. [2022-04-15 06:04:42,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 451 transitions. [2022-04-15 06:04:42,970 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:04:42,984 INFO L225 Difference]: With dead ends: 395 [2022-04-15 06:04:42,984 INFO L226 Difference]: Without dead ends: 381 [2022-04-15 06:04:42,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-15 06:04:42,986 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 932 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:42,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 36 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:04:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-15 06:04:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 143. [2022-04-15 06:04:43,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:43,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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:43,970 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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:43,971 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:43,975 INFO L93 Difference]: Finished difference Result 381 states and 441 transitions. [2022-04-15 06:04:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 441 transitions. [2022-04-15 06:04:43,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:43,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:43,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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 381 states. [2022-04-15 06:04:43,976 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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 381 states. [2022-04-15 06:04:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:43,981 INFO L93 Difference]: Finished difference Result 381 states and 441 transitions. [2022-04-15 06:04:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 441 transitions. [2022-04-15 06:04:43,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:43,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:43,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:43,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 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:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-04-15 06:04:43,984 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2022-04-15 06:04:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:43,984 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-04-15 06:04:43,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.0625) internal successors, (132), 63 states have internal predecessors, (132), 2 states have call successors, (3), 3 states have 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:43,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 144 transitions. [2022-04-15 06:04:44,308 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:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-04-15 06:04:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-15 06:04:44,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:44,309 INFO L499 BasicCegarLoop]: trace histogram [61, 61, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:44,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-15 06:04:44,509 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:04:44,509 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 903876937, now seen corresponding path program 123 times [2022-04-15 06:04:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:44,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388996213] [2022-04-15 06:04:44,513 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:44,513 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:44,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 903876937, now seen corresponding path program 124 times [2022-04-15 06:04:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:44,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368738424] [2022-04-15 06:04:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:45,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {98168#(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(10, 2); {98101#true} is VALID [2022-04-15 06:04:45,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 06:04:45,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 06:04:45,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:45,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {98168#(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(10, 2); {98101#true} is VALID [2022-04-15 06:04:45,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 06:04:45,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 06:04:45,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 06:04:45,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98106#(= main_~i~0 0)} is VALID [2022-04-15 06:04:45,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {98106#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98106#(= main_~i~0 0)} is VALID [2022-04-15 06:04:45,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {98106#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:45,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {98107#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:45,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {98107#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:45,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {98108#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:45,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {98108#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:45,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {98109#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:45,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {98109#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:45,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {98110#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:45,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {98110#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:45,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {98111#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:45,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {98111#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:45,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {98112#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:45,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {98112#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:45,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {98113#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:45,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {98113#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:45,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {98114#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:45,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {98114#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:45,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {98115#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:45,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {98115#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:45,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {98116#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:45,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {98116#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:45,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {98117#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:45,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {98117#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:45,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {98118#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:45,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {98118#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:45,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {98119#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:45,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {98119#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:45,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {98120#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:45,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {98120#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:45,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {98121#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:45,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {98121#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:45,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {98122#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:45,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {98122#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:45,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {98123#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:45,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {98123#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:45,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {98124#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:45,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {98124#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:45,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {98125#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:45,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {98125#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:45,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {98126#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:45,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {98126#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:45,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {98127#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:45,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {98127#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:45,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {98128#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:45,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {98128#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:45,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {98129#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:45,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {98129#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:45,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {98130#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:45,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {98130#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:45,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {98131#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:45,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {98131#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:45,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {98132#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:45,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {98132#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:45,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {98133#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:45,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {98133#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:45,932 INFO L290 TraceCheckUtils]: 62: Hoare triple {98134#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:45,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {98134#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:45,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {98135#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:45,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {98135#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:45,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {98136#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:45,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {98136#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:45,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {98137#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:45,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {98137#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:45,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {98138#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:45,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {98138#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:45,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {98139#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:45,935 INFO L290 TraceCheckUtils]: 73: Hoare triple {98139#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:45,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {98140#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:45,936 INFO L290 TraceCheckUtils]: 75: Hoare triple {98140#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:45,936 INFO L290 TraceCheckUtils]: 76: Hoare triple {98141#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:45,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {98141#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:45,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {98142#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:45,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {98142#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:45,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {98143#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:45,938 INFO L290 TraceCheckUtils]: 81: Hoare triple {98143#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:45,938 INFO L290 TraceCheckUtils]: 82: Hoare triple {98144#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:45,938 INFO L290 TraceCheckUtils]: 83: Hoare triple {98144#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:45,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {98145#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:45,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {98145#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:45,939 INFO L290 TraceCheckUtils]: 86: Hoare triple {98146#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:45,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {98146#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:45,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {98147#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:45,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {98147#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:45,941 INFO L290 TraceCheckUtils]: 90: Hoare triple {98148#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:45,941 INFO L290 TraceCheckUtils]: 91: Hoare triple {98148#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:45,941 INFO L290 TraceCheckUtils]: 92: Hoare triple {98149#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:45,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {98149#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:45,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {98150#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:45,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {98150#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:45,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {98151#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:45,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {98151#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:45,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {98152#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:45,944 INFO L290 TraceCheckUtils]: 99: Hoare triple {98152#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:45,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {98153#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:45,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {98153#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:45,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {98154#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:45,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {98154#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:45,945 INFO L290 TraceCheckUtils]: 104: Hoare triple {98155#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:45,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {98155#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:45,946 INFO L290 TraceCheckUtils]: 106: Hoare triple {98156#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:45,946 INFO L290 TraceCheckUtils]: 107: Hoare triple {98156#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:45,946 INFO L290 TraceCheckUtils]: 108: Hoare triple {98157#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:45,947 INFO L290 TraceCheckUtils]: 109: Hoare triple {98157#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:45,947 INFO L290 TraceCheckUtils]: 110: Hoare triple {98158#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:45,947 INFO L290 TraceCheckUtils]: 111: Hoare triple {98158#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:45,948 INFO L290 TraceCheckUtils]: 112: Hoare triple {98159#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:45,948 INFO L290 TraceCheckUtils]: 113: Hoare triple {98159#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:45,948 INFO L290 TraceCheckUtils]: 114: Hoare triple {98160#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:45,949 INFO L290 TraceCheckUtils]: 115: Hoare triple {98160#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:45,949 INFO L290 TraceCheckUtils]: 116: Hoare triple {98161#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:45,949 INFO L290 TraceCheckUtils]: 117: Hoare triple {98161#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:45,950 INFO L290 TraceCheckUtils]: 118: Hoare triple {98162#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:45,950 INFO L290 TraceCheckUtils]: 119: Hoare triple {98162#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:45,950 INFO L290 TraceCheckUtils]: 120: Hoare triple {98163#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:45,951 INFO L290 TraceCheckUtils]: 121: Hoare triple {98163#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:45,951 INFO L290 TraceCheckUtils]: 122: Hoare triple {98164#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:45,951 INFO L290 TraceCheckUtils]: 123: Hoare triple {98164#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:45,952 INFO L290 TraceCheckUtils]: 124: Hoare triple {98165#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:45,952 INFO L290 TraceCheckUtils]: 125: Hoare triple {98165#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:45,952 INFO L290 TraceCheckUtils]: 126: Hoare triple {98166#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 127: Hoare triple {98166#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98167#(<= main_~i~0 61)} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 128: Hoare triple {98167#(<= main_~i~0 61)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:45,953 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 06:04:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:45,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368738424] [2022-04-15 06:04:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368738424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095830398] [2022-04-15 06:04:45,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:45,957 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:04:45,958 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:04:46,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:46,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:46,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 06:04:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:46,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:47,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98101#true} is VALID [2022-04-15 06:04:47,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#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(10, 2); {98101#true} is VALID [2022-04-15 06:04:47,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 06:04:47,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 06:04:47,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 06:04:47,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98187#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:47,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {98187#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98187#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:47,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {98187#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:47,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {98107#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98107#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:47,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {98107#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:47,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {98108#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98108#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:47,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {98108#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:47,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {98109#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98109#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:47,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {98109#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:47,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {98110#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98110#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:47,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {98110#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:47,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {98111#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98111#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:47,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {98111#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:47,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {98112#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98112#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:47,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {98112#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:47,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {98113#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98113#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:47,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {98113#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:47,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {98114#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98114#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:47,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {98114#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:47,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {98115#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98115#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:47,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {98115#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:47,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {98116#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98116#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:47,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {98116#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:47,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {98117#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98117#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:47,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {98117#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:47,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {98118#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98118#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:47,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {98118#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:47,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {98119#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98119#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:47,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {98119#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:47,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {98120#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98120#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:47,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {98120#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:47,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {98121#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98121#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:47,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {98121#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:47,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {98122#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98122#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:47,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {98122#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:47,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {98123#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98123#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:47,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {98123#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:47,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {98124#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98124#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:47,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {98124#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:47,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {98125#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98125#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:47,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {98125#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:47,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {98126#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98126#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:47,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {98126#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:47,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {98127#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98127#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:47,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {98127#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:47,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {98128#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98128#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:47,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {98128#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:47,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {98129#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98129#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:47,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {98129#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:47,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {98130#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98130#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:47,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {98130#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:47,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {98131#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98131#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:47,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {98131#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:47,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {98132#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98132#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:47,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {98132#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:47,289 INFO L290 TraceCheckUtils]: 60: Hoare triple {98133#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98133#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:47,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {98133#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:47,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {98134#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98134#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:47,290 INFO L290 TraceCheckUtils]: 63: Hoare triple {98134#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:47,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {98135#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98135#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:47,291 INFO L290 TraceCheckUtils]: 65: Hoare triple {98135#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:47,291 INFO L290 TraceCheckUtils]: 66: Hoare triple {98136#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98136#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:47,291 INFO L290 TraceCheckUtils]: 67: Hoare triple {98136#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:47,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {98137#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98137#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:47,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {98137#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:47,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {98138#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98138#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:47,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {98138#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:47,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {98139#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98139#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:47,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {98139#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:47,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {98140#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98140#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:47,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {98140#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:47,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {98141#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98141#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:47,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {98141#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:47,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {98142#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98142#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:47,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {98142#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:47,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {98143#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98143#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:47,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {98143#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:47,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {98144#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98144#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:47,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {98144#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:47,299 INFO L290 TraceCheckUtils]: 84: Hoare triple {98145#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98145#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:47,299 INFO L290 TraceCheckUtils]: 85: Hoare triple {98145#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:47,300 INFO L290 TraceCheckUtils]: 86: Hoare triple {98146#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98146#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:47,300 INFO L290 TraceCheckUtils]: 87: Hoare triple {98146#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:47,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {98147#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98147#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:47,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {98147#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:47,302 INFO L290 TraceCheckUtils]: 90: Hoare triple {98148#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98148#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:47,302 INFO L290 TraceCheckUtils]: 91: Hoare triple {98148#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:47,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {98149#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98149#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:47,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {98149#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:47,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {98150#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98150#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:47,304 INFO L290 TraceCheckUtils]: 95: Hoare triple {98150#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:47,304 INFO L290 TraceCheckUtils]: 96: Hoare triple {98151#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98151#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:47,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {98151#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:47,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {98152#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98152#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:47,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {98152#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:47,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {98153#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98153#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:47,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {98153#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:47,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {98154#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98154#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:47,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {98154#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:47,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {98155#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98155#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:47,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {98155#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:47,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {98156#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98156#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:47,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {98156#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:47,310 INFO L290 TraceCheckUtils]: 108: Hoare triple {98157#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98157#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:47,310 INFO L290 TraceCheckUtils]: 109: Hoare triple {98157#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:47,311 INFO L290 TraceCheckUtils]: 110: Hoare triple {98158#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98158#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:47,311 INFO L290 TraceCheckUtils]: 111: Hoare triple {98158#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:47,312 INFO L290 TraceCheckUtils]: 112: Hoare triple {98159#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98159#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:47,312 INFO L290 TraceCheckUtils]: 113: Hoare triple {98159#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:47,312 INFO L290 TraceCheckUtils]: 114: Hoare triple {98160#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98160#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:47,313 INFO L290 TraceCheckUtils]: 115: Hoare triple {98160#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:47,313 INFO L290 TraceCheckUtils]: 116: Hoare triple {98161#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98161#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:47,314 INFO L290 TraceCheckUtils]: 117: Hoare triple {98161#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:47,314 INFO L290 TraceCheckUtils]: 118: Hoare triple {98162#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98162#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:47,315 INFO L290 TraceCheckUtils]: 119: Hoare triple {98162#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:47,315 INFO L290 TraceCheckUtils]: 120: Hoare triple {98163#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98163#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:47,316 INFO L290 TraceCheckUtils]: 121: Hoare triple {98163#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:47,316 INFO L290 TraceCheckUtils]: 122: Hoare triple {98164#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98164#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:47,316 INFO L290 TraceCheckUtils]: 123: Hoare triple {98164#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:47,317 INFO L290 TraceCheckUtils]: 124: Hoare triple {98165#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98165#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:47,317 INFO L290 TraceCheckUtils]: 125: Hoare triple {98165#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:47,318 INFO L290 TraceCheckUtils]: 126: Hoare triple {98166#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98166#(<= main_~i~0 60)} is VALID [2022-04-15 06:04:47,318 INFO L290 TraceCheckUtils]: 127: Hoare triple {98166#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98167#(<= main_~i~0 61)} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 128: Hoare triple {98167#(<= main_~i~0 61)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:47,319 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 06:04:47,320 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 06:04:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:47,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:51,594 INFO L290 TraceCheckUtils]: 141: Hoare triple {98102#false} assume !false; {98102#false} is VALID [2022-04-15 06:04:51,594 INFO L290 TraceCheckUtils]: 140: Hoare triple {98102#false} assume 0 == ~cond; {98102#false} is VALID [2022-04-15 06:04:51,594 INFO L290 TraceCheckUtils]: 139: Hoare triple {98102#false} ~cond := #in~cond; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L272 TraceCheckUtils]: 138: Hoare triple {98102#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 137: Hoare triple {98102#false} assume !(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 136: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 135: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 134: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 133: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {98102#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 131: Hoare triple {98102#false} assume !!(0 != #t~mem4);havoc #t~mem4; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 130: Hoare triple {98102#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 129: Hoare triple {98102#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {98102#false} is VALID [2022-04-15 06:04:51,595 INFO L290 TraceCheckUtils]: 128: Hoare triple {98635#(< main_~i~0 1023)} assume !(~i~0 < 1023); {98102#false} is VALID [2022-04-15 06:04:51,596 INFO L290 TraceCheckUtils]: 127: Hoare triple {98639#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98635#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:51,596 INFO L290 TraceCheckUtils]: 126: Hoare triple {98639#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98639#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:51,597 INFO L290 TraceCheckUtils]: 125: Hoare triple {98646#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98639#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:51,597 INFO L290 TraceCheckUtils]: 124: Hoare triple {98646#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98646#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:51,597 INFO L290 TraceCheckUtils]: 123: Hoare triple {98653#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98646#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:51,598 INFO L290 TraceCheckUtils]: 122: Hoare triple {98653#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98653#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:51,598 INFO L290 TraceCheckUtils]: 121: Hoare triple {98660#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98653#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:51,598 INFO L290 TraceCheckUtils]: 120: Hoare triple {98660#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98660#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:51,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {98667#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98660#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:51,599 INFO L290 TraceCheckUtils]: 118: Hoare triple {98667#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98667#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:51,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {98674#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98667#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:51,599 INFO L290 TraceCheckUtils]: 116: Hoare triple {98674#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98674#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:51,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {98681#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98674#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:51,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {98681#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98681#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:51,601 INFO L290 TraceCheckUtils]: 113: Hoare triple {98688#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98681#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:51,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {98688#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98688#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:51,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {98695#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98688#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:51,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {98695#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98695#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:51,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {98702#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98695#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:51,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {98702#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98702#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:51,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {98709#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98702#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:51,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {98709#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98709#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:51,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {98716#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98709#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:51,603 INFO L290 TraceCheckUtils]: 104: Hoare triple {98716#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98716#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:51,604 INFO L290 TraceCheckUtils]: 103: Hoare triple {98723#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98716#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:51,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {98723#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98723#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:51,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {98730#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98723#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:51,605 INFO L290 TraceCheckUtils]: 100: Hoare triple {98730#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98730#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:51,605 INFO L290 TraceCheckUtils]: 99: Hoare triple {98737#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98730#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:51,605 INFO L290 TraceCheckUtils]: 98: Hoare triple {98737#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98737#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:51,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {98744#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98737#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:51,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {98744#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98744#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:51,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {98751#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98744#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:51,607 INFO L290 TraceCheckUtils]: 94: Hoare triple {98751#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98751#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:51,607 INFO L290 TraceCheckUtils]: 93: Hoare triple {98758#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98751#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:51,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {98758#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98758#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:51,608 INFO L290 TraceCheckUtils]: 91: Hoare triple {98765#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98758#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:51,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {98765#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98765#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:51,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {98772#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98765#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:51,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {98772#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98772#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:51,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {98779#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98772#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:51,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {98779#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98779#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:51,610 INFO L290 TraceCheckUtils]: 85: Hoare triple {98786#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98779#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:51,610 INFO L290 TraceCheckUtils]: 84: Hoare triple {98786#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98786#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:51,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {98793#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98786#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:51,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {98793#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98793#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:51,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {98800#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98793#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:51,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {98800#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98800#(< main_~i~0 999)} is VALID [2022-04-15 06:04:51,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {98807#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98800#(< main_~i~0 999)} is VALID [2022-04-15 06:04:51,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {98807#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98807#(< main_~i~0 998)} is VALID [2022-04-15 06:04:51,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {98814#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98807#(< main_~i~0 998)} is VALID [2022-04-15 06:04:51,613 INFO L290 TraceCheckUtils]: 76: Hoare triple {98814#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98814#(< main_~i~0 997)} is VALID [2022-04-15 06:04:51,613 INFO L290 TraceCheckUtils]: 75: Hoare triple {98821#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98814#(< main_~i~0 997)} is VALID [2022-04-15 06:04:51,613 INFO L290 TraceCheckUtils]: 74: Hoare triple {98821#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98821#(< main_~i~0 996)} is VALID [2022-04-15 06:04:51,614 INFO L290 TraceCheckUtils]: 73: Hoare triple {98828#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98821#(< main_~i~0 996)} is VALID [2022-04-15 06:04:51,614 INFO L290 TraceCheckUtils]: 72: Hoare triple {98828#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98828#(< main_~i~0 995)} is VALID [2022-04-15 06:04:51,614 INFO L290 TraceCheckUtils]: 71: Hoare triple {98835#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98828#(< main_~i~0 995)} is VALID [2022-04-15 06:04:51,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {98835#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98835#(< main_~i~0 994)} is VALID [2022-04-15 06:04:51,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {98842#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98835#(< main_~i~0 994)} is VALID [2022-04-15 06:04:51,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {98842#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98842#(< main_~i~0 993)} is VALID [2022-04-15 06:04:51,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {98849#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98842#(< main_~i~0 993)} is VALID [2022-04-15 06:04:51,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {98849#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98849#(< main_~i~0 992)} is VALID [2022-04-15 06:04:51,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {98856#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98849#(< main_~i~0 992)} is VALID [2022-04-15 06:04:51,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {98856#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98856#(< main_~i~0 991)} is VALID [2022-04-15 06:04:51,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {98863#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98856#(< main_~i~0 991)} is VALID [2022-04-15 06:04:51,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {98863#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98863#(< main_~i~0 990)} is VALID [2022-04-15 06:04:51,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {98870#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98863#(< main_~i~0 990)} is VALID [2022-04-15 06:04:51,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {98870#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98870#(< main_~i~0 989)} is VALID [2022-04-15 06:04:51,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {98877#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98870#(< main_~i~0 989)} is VALID [2022-04-15 06:04:51,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {98877#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98877#(< main_~i~0 988)} is VALID [2022-04-15 06:04:51,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {98884#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98877#(< main_~i~0 988)} is VALID [2022-04-15 06:04:51,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {98884#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98884#(< main_~i~0 987)} is VALID [2022-04-15 06:04:51,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {98891#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98884#(< main_~i~0 987)} is VALID [2022-04-15 06:04:51,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {98891#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98891#(< main_~i~0 986)} is VALID [2022-04-15 06:04:51,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {98898#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98891#(< main_~i~0 986)} is VALID [2022-04-15 06:04:51,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {98898#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98898#(< main_~i~0 985)} is VALID [2022-04-15 06:04:51,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {98905#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98898#(< main_~i~0 985)} is VALID [2022-04-15 06:04:51,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {98905#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98905#(< main_~i~0 984)} is VALID [2022-04-15 06:04:51,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {98912#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98905#(< main_~i~0 984)} is VALID [2022-04-15 06:04:51,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {98912#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98912#(< main_~i~0 983)} is VALID [2022-04-15 06:04:51,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {98919#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98912#(< main_~i~0 983)} is VALID [2022-04-15 06:04:51,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {98919#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98919#(< main_~i~0 982)} is VALID [2022-04-15 06:04:51,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {98926#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98919#(< main_~i~0 982)} is VALID [2022-04-15 06:04:51,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {98926#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98926#(< main_~i~0 981)} is VALID [2022-04-15 06:04:51,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {98933#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98926#(< main_~i~0 981)} is VALID [2022-04-15 06:04:51,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {98933#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98933#(< main_~i~0 980)} is VALID [2022-04-15 06:04:51,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {98940#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98933#(< main_~i~0 980)} is VALID [2022-04-15 06:04:51,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {98940#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98940#(< main_~i~0 979)} is VALID [2022-04-15 06:04:51,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {98947#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98940#(< main_~i~0 979)} is VALID [2022-04-15 06:04:51,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {98947#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98947#(< main_~i~0 978)} is VALID [2022-04-15 06:04:51,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {98954#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98947#(< main_~i~0 978)} is VALID [2022-04-15 06:04:51,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {98954#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98954#(< main_~i~0 977)} is VALID [2022-04-15 06:04:51,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {98961#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98954#(< main_~i~0 977)} is VALID [2022-04-15 06:04:51,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {98961#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98961#(< main_~i~0 976)} is VALID [2022-04-15 06:04:51,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {98968#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98961#(< main_~i~0 976)} is VALID [2022-04-15 06:04:51,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {98968#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98968#(< main_~i~0 975)} is VALID [2022-04-15 06:04:51,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {98975#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98968#(< main_~i~0 975)} is VALID [2022-04-15 06:04:51,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {98975#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98975#(< main_~i~0 974)} is VALID [2022-04-15 06:04:51,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {98982#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98975#(< main_~i~0 974)} is VALID [2022-04-15 06:04:51,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {98982#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98982#(< main_~i~0 973)} is VALID [2022-04-15 06:04:51,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {98989#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98982#(< main_~i~0 973)} is VALID [2022-04-15 06:04:51,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {98989#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98989#(< main_~i~0 972)} is VALID [2022-04-15 06:04:51,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {98996#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98989#(< main_~i~0 972)} is VALID [2022-04-15 06:04:51,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {98996#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98996#(< main_~i~0 971)} is VALID [2022-04-15 06:04:51,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {99003#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98996#(< main_~i~0 971)} is VALID [2022-04-15 06:04:51,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {99003#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99003#(< main_~i~0 970)} is VALID [2022-04-15 06:04:51,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {99010#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99003#(< main_~i~0 970)} is VALID [2022-04-15 06:04:51,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {99010#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99010#(< main_~i~0 969)} is VALID [2022-04-15 06:04:51,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {99017#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99010#(< main_~i~0 969)} is VALID [2022-04-15 06:04:51,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {99017#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99017#(< main_~i~0 968)} is VALID [2022-04-15 06:04:51,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {99024#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99017#(< main_~i~0 968)} is VALID [2022-04-15 06:04:51,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {99024#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99024#(< main_~i~0 967)} is VALID [2022-04-15 06:04:51,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {99031#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99024#(< main_~i~0 967)} is VALID [2022-04-15 06:04:51,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {99031#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99031#(< main_~i~0 966)} is VALID [2022-04-15 06:04:51,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {99038#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99031#(< main_~i~0 966)} is VALID [2022-04-15 06:04:51,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {99038#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99038#(< main_~i~0 965)} is VALID [2022-04-15 06:04:51,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {99045#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99038#(< main_~i~0 965)} is VALID [2022-04-15 06:04:51,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {99045#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99045#(< main_~i~0 964)} is VALID [2022-04-15 06:04:51,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {99052#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99045#(< main_~i~0 964)} is VALID [2022-04-15 06:04:51,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {99052#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99052#(< main_~i~0 963)} is VALID [2022-04-15 06:04:51,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {99059#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99052#(< main_~i~0 963)} is VALID [2022-04-15 06:04:51,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {99059#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99059#(< main_~i~0 962)} is VALID [2022-04-15 06:04:51,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {98101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {99059#(< main_~i~0 962)} is VALID [2022-04-15 06:04:51,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {98101#true} call #t~ret5 := main(); {98101#true} is VALID [2022-04-15 06:04:51,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98101#true} {98101#true} #58#return; {98101#true} is VALID [2022-04-15 06:04:51,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {98101#true} assume true; {98101#true} is VALID [2022-04-15 06:04:51,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {98101#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(10, 2); {98101#true} is VALID [2022-04-15 06:04:51,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {98101#true} call ULTIMATE.init(); {98101#true} is VALID [2022-04-15 06:04:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:04:51,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095830398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:51,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:51,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 06:04:51,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388996213] [2022-04-15 06:04:51,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388996213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:51,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:51,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 06:04:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840597526] [2022-04-15 06:04:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:51,638 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 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 142 [2022-04-15 06:04:51,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:51,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have 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:51,726 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:04:51,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 06:04:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:51,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 06:04:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:04:51,728 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have 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:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:07,932 INFO L93 Difference]: Finished difference Result 401 states and 463 transitions. [2022-04-15 06:05:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:05:07,932 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 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 142 [2022-04-15 06:05:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have 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:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 458 transitions. [2022-04-15 06:05:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have 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:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 458 transitions. [2022-04-15 06:05:07,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 458 transitions. [2022-04-15 06:05:08,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:08,330 INFO L225 Difference]: With dead ends: 401 [2022-04-15 06:05:08,331 INFO L226 Difference]: Without dead ends: 387 [2022-04-15 06:05:08,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 06:05:08,336 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1053 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:08,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 41 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:05:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-15 06:05:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 145. [2022-04-15 06:05:09,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:09,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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:05:09,864 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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:05:09,865 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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:05:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:09,872 INFO L93 Difference]: Finished difference Result 387 states and 448 transitions. [2022-04-15 06:05:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 448 transitions. [2022-04-15 06:05:09,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:09,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:09,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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 387 states. [2022-04-15 06:05:09,873 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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 387 states. [2022-04-15 06:05:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:09,881 INFO L93 Difference]: Finished difference Result 387 states and 448 transitions. [2022-04-15 06:05:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 448 transitions. [2022-04-15 06:05:09,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:09,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:09,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:09,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 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:05:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2022-04-15 06:05:09,884 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2022-04-15 06:05:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:09,884 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2022-04-15 06:05:09,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 64 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have 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:09,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 146 transitions. [2022-04-15 06:05:10,302 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:05:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2022-04-15 06:05:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 06:05:10,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:10,303 INFO L499 BasicCegarLoop]: trace histogram [62, 62, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:10,332 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:05:10,527 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:05:10,527 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -720002581, now seen corresponding path program 125 times [2022-04-15 06:05:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:10,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140646897] [2022-04-15 06:05:10,532 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:10,533 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:10,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -720002581, now seen corresponding path program 126 times [2022-04-15 06:05:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:10,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090424981] [2022-04-15 06:05:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:12,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:12,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {101141#(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(10, 2); {101073#true} is VALID [2022-04-15 06:05:12,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 06:05:12,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 06:05:12,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:12,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {101141#(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(10, 2); {101073#true} is VALID [2022-04-15 06:05:12,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 06:05:12,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 06:05:12,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 06:05:12,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101078#(= main_~i~0 0)} is VALID [2022-04-15 06:05:12,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {101078#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101078#(= main_~i~0 0)} is VALID [2022-04-15 06:05:12,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {101078#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:12,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {101079#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:12,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {101079#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:12,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {101080#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:12,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {101080#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101081#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:12,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {101081#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101081#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:12,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {101081#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101082#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:12,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {101082#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101082#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:12,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {101082#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101083#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:12,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {101083#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101083#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:12,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {101083#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101084#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:12,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {101084#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101084#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:12,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {101084#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101085#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:12,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {101085#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101085#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:12,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {101085#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101086#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:12,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {101086#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101086#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:12,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {101086#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101087#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:12,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {101087#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101087#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:12,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {101087#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101088#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:12,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {101088#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101088#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:12,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {101088#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101089#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:12,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {101089#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101089#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:12,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {101089#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101090#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:12,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {101090#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101090#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:12,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {101090#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101091#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:12,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {101091#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101091#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:12,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {101091#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101092#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:12,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {101092#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101092#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:12,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {101092#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101093#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:12,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {101093#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101093#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:12,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {101093#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101094#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:12,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {101094#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101094#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:12,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {101094#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101095#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:12,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {101095#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101095#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:12,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {101095#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101096#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:12,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {101096#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101096#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:12,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {101096#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101097#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:12,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {101097#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101097#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:12,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {101097#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101098#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:12,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {101098#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101098#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:12,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {101098#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101099#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:12,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {101099#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101099#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:12,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {101099#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101100#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:12,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {101100#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101100#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:12,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {101100#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101101#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:12,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {101101#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101101#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:12,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {101101#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101102#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:12,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {101102#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101102#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:12,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {101102#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101103#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:12,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {101103#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101103#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:12,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {101103#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101104#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:12,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {101104#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101104#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:12,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {101104#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101105#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:12,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {101105#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101105#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:12,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {101105#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101106#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:12,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {101106#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101106#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:12,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {101106#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101107#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:12,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {101107#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101107#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:12,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {101107#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101108#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:12,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {101108#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101108#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:12,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {101108#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101109#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:12,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {101109#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101109#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:12,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {101109#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101110#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:12,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {101110#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101110#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:12,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {101110#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101111#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:12,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {101111#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101111#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:12,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {101111#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101112#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:12,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {101112#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101112#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:12,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {101112#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101113#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:12,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {101113#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101113#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:12,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {101113#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101114#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:12,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {101114#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101114#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:12,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {101114#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101115#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:12,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {101115#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101115#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:12,335 INFO L290 TraceCheckUtils]: 81: Hoare triple {101115#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101116#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:12,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {101116#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101116#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:12,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {101116#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101117#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:12,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {101117#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101117#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:12,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {101117#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101118#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:12,337 INFO L290 TraceCheckUtils]: 86: Hoare triple {101118#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101118#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:12,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {101118#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101119#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:12,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {101119#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101119#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:12,338 INFO L290 TraceCheckUtils]: 89: Hoare triple {101119#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101120#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:12,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {101120#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101120#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:12,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {101120#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101121#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:12,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {101121#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101121#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:12,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {101121#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101122#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:12,340 INFO L290 TraceCheckUtils]: 94: Hoare triple {101122#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101122#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:12,340 INFO L290 TraceCheckUtils]: 95: Hoare triple {101122#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101123#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:12,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {101123#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101123#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:12,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {101123#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101124#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:12,341 INFO L290 TraceCheckUtils]: 98: Hoare triple {101124#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101124#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:12,342 INFO L290 TraceCheckUtils]: 99: Hoare triple {101124#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101125#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:12,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {101125#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101125#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:12,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {101125#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101126#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:12,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {101126#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101126#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:12,343 INFO L290 TraceCheckUtils]: 103: Hoare triple {101126#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101127#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:12,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {101127#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101127#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:12,344 INFO L290 TraceCheckUtils]: 105: Hoare triple {101127#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101128#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:12,344 INFO L290 TraceCheckUtils]: 106: Hoare triple {101128#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101128#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:12,345 INFO L290 TraceCheckUtils]: 107: Hoare triple {101128#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101129#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:12,345 INFO L290 TraceCheckUtils]: 108: Hoare triple {101129#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101129#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:12,346 INFO L290 TraceCheckUtils]: 109: Hoare triple {101129#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101130#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:12,346 INFO L290 TraceCheckUtils]: 110: Hoare triple {101130#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101130#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:12,346 INFO L290 TraceCheckUtils]: 111: Hoare triple {101130#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101131#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:12,347 INFO L290 TraceCheckUtils]: 112: Hoare triple {101131#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101131#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:12,347 INFO L290 TraceCheckUtils]: 113: Hoare triple {101131#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101132#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:12,348 INFO L290 TraceCheckUtils]: 114: Hoare triple {101132#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101132#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:12,348 INFO L290 TraceCheckUtils]: 115: Hoare triple {101132#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101133#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:12,348 INFO L290 TraceCheckUtils]: 116: Hoare triple {101133#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101133#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:12,349 INFO L290 TraceCheckUtils]: 117: Hoare triple {101133#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101134#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:12,349 INFO L290 TraceCheckUtils]: 118: Hoare triple {101134#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101134#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:12,350 INFO L290 TraceCheckUtils]: 119: Hoare triple {101134#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101135#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:12,350 INFO L290 TraceCheckUtils]: 120: Hoare triple {101135#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101135#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:12,350 INFO L290 TraceCheckUtils]: 121: Hoare triple {101135#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101136#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:12,351 INFO L290 TraceCheckUtils]: 122: Hoare triple {101136#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101136#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:12,351 INFO L290 TraceCheckUtils]: 123: Hoare triple {101136#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101137#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:12,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {101137#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101137#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:12,352 INFO L290 TraceCheckUtils]: 125: Hoare triple {101137#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101138#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:12,352 INFO L290 TraceCheckUtils]: 126: Hoare triple {101138#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101138#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:12,353 INFO L290 TraceCheckUtils]: 127: Hoare triple {101138#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101139#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:12,353 INFO L290 TraceCheckUtils]: 128: Hoare triple {101139#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101139#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:12,354 INFO L290 TraceCheckUtils]: 129: Hoare triple {101139#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101140#(<= main_~i~0 62)} is VALID [2022-04-15 06:05:12,354 INFO L290 TraceCheckUtils]: 130: Hoare triple {101140#(<= main_~i~0 62)} assume !(~i~0 < 1023); {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 131: Hoare triple {101074#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 132: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {101074#false} assume !!(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 134: Hoare triple {101074#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 135: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {101074#false} assume !!(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 137: Hoare triple {101074#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {101074#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101074#false} is VALID [2022-04-15 06:05:12,355 INFO L290 TraceCheckUtils]: 139: Hoare triple {101074#false} assume !(0 != #t~mem4);havoc #t~mem4; {101074#false} is VALID [2022-04-15 06:05:12,356 INFO L272 TraceCheckUtils]: 140: Hoare triple {101074#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101074#false} is VALID [2022-04-15 06:05:12,356 INFO L290 TraceCheckUtils]: 141: Hoare triple {101074#false} ~cond := #in~cond; {101074#false} is VALID [2022-04-15 06:05:12,356 INFO L290 TraceCheckUtils]: 142: Hoare triple {101074#false} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 06:05:12,356 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 06:05:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:05:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090424981] [2022-04-15 06:05:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090424981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359295704] [2022-04-15 06:05:12,358 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:05:12,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:12,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:12,359 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:05:12,360 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:05:12,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:05:12,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:12,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:05:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:12,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:13,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101073#true} is VALID [2022-04-15 06:05:13,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#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(10, 2); {101073#true} is VALID [2022-04-15 06:05:13,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 06:05:13,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 06:05:13,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 06:05:13,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 76: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 77: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 78: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 79: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 80: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 81: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,283 INFO L290 TraceCheckUtils]: 83: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 84: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 85: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 86: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 87: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 88: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 92: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 93: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,284 INFO L290 TraceCheckUtils]: 94: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 95: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 96: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 97: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 98: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 99: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 100: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 101: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 103: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 104: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,285 INFO L290 TraceCheckUtils]: 105: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 106: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 107: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 108: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 109: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 110: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 111: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 112: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 113: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 114: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 115: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 116: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,286 INFO L290 TraceCheckUtils]: 117: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 118: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 119: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 120: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 121: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 122: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 123: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 124: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 125: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 126: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 127: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,287 INFO L290 TraceCheckUtils]: 128: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,288 INFO L290 TraceCheckUtils]: 129: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,288 INFO L290 TraceCheckUtils]: 130: Hoare triple {101073#true} assume !(~i~0 < 1023); {101073#true} is VALID [2022-04-15 06:05:13,288 INFO L290 TraceCheckUtils]: 131: Hoare triple {101073#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101538#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:13,288 INFO L290 TraceCheckUtils]: 132: Hoare triple {101538#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101538#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:13,289 INFO L290 TraceCheckUtils]: 133: Hoare triple {101538#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {101538#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:13,289 INFO L290 TraceCheckUtils]: 134: Hoare triple {101538#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:13,289 INFO L290 TraceCheckUtils]: 135: Hoare triple {101079#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101079#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:13,290 INFO L290 TraceCheckUtils]: 136: Hoare triple {101079#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {101079#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:13,290 INFO L290 TraceCheckUtils]: 137: Hoare triple {101079#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:13,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {101080#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101080#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:13,291 INFO L290 TraceCheckUtils]: 139: Hoare triple {101080#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {101080#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:13,291 INFO L272 TraceCheckUtils]: 140: Hoare triple {101080#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:05:13,292 INFO L290 TraceCheckUtils]: 141: Hoare triple {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:05:13,292 INFO L290 TraceCheckUtils]: 142: Hoare triple {101570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 06:05:13,292 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 06:05:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 06:05:13,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:13,739 INFO L290 TraceCheckUtils]: 143: Hoare triple {101074#false} assume !false; {101074#false} is VALID [2022-04-15 06:05:13,739 INFO L290 TraceCheckUtils]: 142: Hoare triple {101570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101074#false} is VALID [2022-04-15 06:05:13,740 INFO L290 TraceCheckUtils]: 141: Hoare triple {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:05:13,740 INFO L272 TraceCheckUtils]: 140: Hoare triple {101586#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {101566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:05:13,740 INFO L290 TraceCheckUtils]: 139: Hoare triple {101586#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 06:05:13,741 INFO L290 TraceCheckUtils]: 138: Hoare triple {101586#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 06:05:13,741 INFO L290 TraceCheckUtils]: 137: Hoare triple {101596#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101586#(<= main_~i~0 1024)} is VALID [2022-04-15 06:05:13,742 INFO L290 TraceCheckUtils]: 136: Hoare triple {101596#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 06:05:13,742 INFO L290 TraceCheckUtils]: 135: Hoare triple {101596#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 06:05:13,742 INFO L290 TraceCheckUtils]: 134: Hoare triple {101606#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101596#(<= main_~i~0 1023)} is VALID [2022-04-15 06:05:13,743 INFO L290 TraceCheckUtils]: 133: Hoare triple {101606#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 06:05:13,743 INFO L290 TraceCheckUtils]: 132: Hoare triple {101606#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 06:05:13,743 INFO L290 TraceCheckUtils]: 131: Hoare triple {101073#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {101606#(<= main_~i~0 1022)} is VALID [2022-04-15 06:05:13,743 INFO L290 TraceCheckUtils]: 130: Hoare triple {101073#true} assume !(~i~0 < 1023); {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 129: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 128: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 127: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 126: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 125: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 124: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 123: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 122: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 121: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 120: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,744 INFO L290 TraceCheckUtils]: 119: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 118: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 117: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 116: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 115: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 114: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 113: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 112: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 111: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 110: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 109: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 108: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,745 INFO L290 TraceCheckUtils]: 107: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 106: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 105: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 104: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 103: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 102: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 101: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 96: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,746 INFO L290 TraceCheckUtils]: 95: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 91: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 90: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 74: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {101073#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {101073#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {101073#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101073#true} is VALID [2022-04-15 06:05:13,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {101073#true} call #t~ret5 := main(); {101073#true} is VALID [2022-04-15 06:05:13,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101073#true} {101073#true} #58#return; {101073#true} is VALID [2022-04-15 06:05:13,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {101073#true} assume true; {101073#true} is VALID [2022-04-15 06:05:13,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {101073#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(10, 2); {101073#true} is VALID [2022-04-15 06:05:13,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {101073#true} call ULTIMATE.init(); {101073#true} is VALID [2022-04-15 06:05:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 06:05:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359295704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:13,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:13,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 7, 7] total 72 [2022-04-15 06:05:13,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140646897] [2022-04-15 06:05:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140646897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:13,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:13,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:05:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721299587] [2022-04-15 06:05:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 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 144 [2022-04-15 06:05:13,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:13,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have 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:13,863 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:05:13,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:05:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:05:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=2760, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:05:13,866 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have 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:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:31,341 INFO L93 Difference]: Finished difference Result 407 states and 470 transitions. [2022-04-15 06:05:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 06:05:31,341 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 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 144 [2022-04-15 06:05:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have 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:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 465 transitions. [2022-04-15 06:05:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have 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:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 465 transitions. [2022-04-15 06:05:31,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 465 transitions. [2022-04-15 06:05:31,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:31,732 INFO L225 Difference]: With dead ends: 407 [2022-04-15 06:05:31,733 INFO L226 Difference]: Without dead ends: 393 [2022-04-15 06:05:31,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6700, Invalid=11390, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 06:05:31,734 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 864 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:31,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 61 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:05:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-15 06:05:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 147. [2022-04-15 06:05:32,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:32,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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:32,882 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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:32,882 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:32,891 INFO L93 Difference]: Finished difference Result 393 states and 455 transitions. [2022-04-15 06:05:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 455 transitions. [2022-04-15 06:05:32,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:32,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:32,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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 393 states. [2022-04-15 06:05:32,893 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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 393 states. [2022-04-15 06:05:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:32,901 INFO L93 Difference]: Finished difference Result 393 states and 455 transitions. [2022-04-15 06:05:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 455 transitions. [2022-04-15 06:05:32,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:32,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:32,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:32,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 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:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-15 06:05:32,904 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2022-04-15 06:05:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:32,905 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-15 06:05:32,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have 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:32,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-15 06:05:33,267 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:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-15 06:05:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 06:05:33,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:33,268 INFO L499 BasicCegarLoop]: trace histogram [63, 63, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:33,286 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:05:33,468 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:05:33,469 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2099876365, now seen corresponding path program 127 times [2022-04-15 06:05:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:33,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509430854] [2022-04-15 06:05: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:05:33,475 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:33,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2099876365, now seen corresponding path program 128 times [2022-04-15 06:05:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:33,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389355587] [2022-04-15 06:05:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:35,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:35,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {104100#(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(10, 2); {104031#true} is VALID [2022-04-15 06:05:35,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 06:05:35,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 06:05:35,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:35,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {104100#(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(10, 2); {104031#true} is VALID [2022-04-15 06:05:35,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 06:05:35,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 06:05:35,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 06:05:35,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104036#(= main_~i~0 0)} is VALID [2022-04-15 06:05:35,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {104036#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104036#(= main_~i~0 0)} is VALID [2022-04-15 06:05:35,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {104036#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:35,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {104037#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:35,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {104037#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:35,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {104038#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:35,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {104038#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:35,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {104039#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:35,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {104039#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:35,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {104040#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:35,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {104040#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:35,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {104041#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:35,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {104041#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:35,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {104042#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:35,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {104042#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:35,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {104043#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:35,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {104043#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:35,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {104044#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:35,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {104044#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:35,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {104045#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:35,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {104045#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:35,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {104046#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:35,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {104046#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:35,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {104047#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:35,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {104047#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:35,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {104048#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:35,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {104048#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:35,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {104049#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:35,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {104049#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:35,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {104050#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:35,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {104050#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:35,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {104051#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:35,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {104051#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:35,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {104052#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:35,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {104052#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:35,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {104053#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:35,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {104053#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:35,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {104054#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:35,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {104054#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:35,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {104055#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:35,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {104055#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:35,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {104056#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:35,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {104056#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:35,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {104057#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:35,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {104057#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:35,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {104058#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:35,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {104058#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:35,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {104059#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:35,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {104059#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:35,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {104060#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:35,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {104060#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:35,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {104061#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:35,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {104061#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:35,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {104062#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:35,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {104062#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:35,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {104063#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:35,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {104063#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:35,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {104064#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:35,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {104064#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:35,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {104065#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:35,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {104065#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:35,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {104066#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:35,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {104066#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:35,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {104067#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:35,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {104067#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:35,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {104068#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:35,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {104068#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:35,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {104069#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:35,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {104069#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:35,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {104070#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:35,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {104070#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:35,167 INFO L290 TraceCheckUtils]: 76: Hoare triple {104071#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:35,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {104071#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:35,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {104072#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:35,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {104072#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:35,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {104073#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:35,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {104073#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:35,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {104074#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:35,170 INFO L290 TraceCheckUtils]: 83: Hoare triple {104074#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:35,170 INFO L290 TraceCheckUtils]: 84: Hoare triple {104075#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:35,170 INFO L290 TraceCheckUtils]: 85: Hoare triple {104075#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:35,171 INFO L290 TraceCheckUtils]: 86: Hoare triple {104076#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:35,171 INFO L290 TraceCheckUtils]: 87: Hoare triple {104076#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:35,171 INFO L290 TraceCheckUtils]: 88: Hoare triple {104077#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:35,172 INFO L290 TraceCheckUtils]: 89: Hoare triple {104077#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:35,172 INFO L290 TraceCheckUtils]: 90: Hoare triple {104078#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:35,172 INFO L290 TraceCheckUtils]: 91: Hoare triple {104078#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:35,172 INFO L290 TraceCheckUtils]: 92: Hoare triple {104079#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:35,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {104079#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:35,173 INFO L290 TraceCheckUtils]: 94: Hoare triple {104080#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:35,173 INFO L290 TraceCheckUtils]: 95: Hoare triple {104080#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:35,174 INFO L290 TraceCheckUtils]: 96: Hoare triple {104081#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:35,174 INFO L290 TraceCheckUtils]: 97: Hoare triple {104081#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:35,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {104082#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:35,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {104082#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:35,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {104083#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:35,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {104083#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:35,176 INFO L290 TraceCheckUtils]: 102: Hoare triple {104084#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:35,176 INFO L290 TraceCheckUtils]: 103: Hoare triple {104084#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:35,176 INFO L290 TraceCheckUtils]: 104: Hoare triple {104085#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:35,177 INFO L290 TraceCheckUtils]: 105: Hoare triple {104085#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:35,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {104086#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:35,177 INFO L290 TraceCheckUtils]: 107: Hoare triple {104086#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:35,178 INFO L290 TraceCheckUtils]: 108: Hoare triple {104087#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:35,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {104087#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:35,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {104088#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:35,179 INFO L290 TraceCheckUtils]: 111: Hoare triple {104088#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:35,179 INFO L290 TraceCheckUtils]: 112: Hoare triple {104089#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:35,179 INFO L290 TraceCheckUtils]: 113: Hoare triple {104089#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:35,180 INFO L290 TraceCheckUtils]: 114: Hoare triple {104090#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:35,180 INFO L290 TraceCheckUtils]: 115: Hoare triple {104090#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:35,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {104091#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:35,181 INFO L290 TraceCheckUtils]: 117: Hoare triple {104091#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:35,181 INFO L290 TraceCheckUtils]: 118: Hoare triple {104092#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:35,181 INFO L290 TraceCheckUtils]: 119: Hoare triple {104092#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:35,182 INFO L290 TraceCheckUtils]: 120: Hoare triple {104093#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:35,182 INFO L290 TraceCheckUtils]: 121: Hoare triple {104093#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:35,182 INFO L290 TraceCheckUtils]: 122: Hoare triple {104094#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:35,183 INFO L290 TraceCheckUtils]: 123: Hoare triple {104094#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:35,183 INFO L290 TraceCheckUtils]: 124: Hoare triple {104095#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:35,183 INFO L290 TraceCheckUtils]: 125: Hoare triple {104095#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:35,183 INFO L290 TraceCheckUtils]: 126: Hoare triple {104096#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:35,184 INFO L290 TraceCheckUtils]: 127: Hoare triple {104096#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:35,184 INFO L290 TraceCheckUtils]: 128: Hoare triple {104097#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:35,184 INFO L290 TraceCheckUtils]: 129: Hoare triple {104097#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 06:05:35,185 INFO L290 TraceCheckUtils]: 130: Hoare triple {104098#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 06:05:35,185 INFO L290 TraceCheckUtils]: 131: Hoare triple {104098#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104099#(<= main_~i~0 63)} is VALID [2022-04-15 06:05:35,185 INFO L290 TraceCheckUtils]: 132: Hoare triple {104099#(<= main_~i~0 63)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 06:05:35,186 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 06:05:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:05:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389355587] [2022-04-15 06:05:35,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389355587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233203774] [2022-04-15 06:05:35,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:05:35,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:35,188 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:05:35,189 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:05:35,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:05:35,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:35,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 06:05:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:35,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:36,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104031#true} is VALID [2022-04-15 06:05:36,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#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(10, 2); {104031#true} is VALID [2022-04-15 06:05:36,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 06:05:36,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 06:05:36,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 06:05:36,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104119#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:36,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {104119#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104119#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:36,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {104119#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:36,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {104037#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104037#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:36,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {104037#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:36,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {104038#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104038#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:36,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {104038#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:36,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {104039#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104039#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:36,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {104039#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:36,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {104040#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104040#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:36,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {104040#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:36,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {104041#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104041#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:36,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {104041#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:36,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {104042#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104042#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:36,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {104042#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:36,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {104043#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104043#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:36,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {104043#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:36,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {104044#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104044#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:36,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {104044#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:36,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {104045#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104045#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:36,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {104045#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:36,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {104046#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104046#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:36,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {104046#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:36,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {104047#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104047#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:36,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {104047#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:36,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {104048#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104048#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:36,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {104048#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:36,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {104049#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104049#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:36,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {104049#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:36,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {104050#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104050#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:36,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {104050#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:36,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {104051#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104051#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:36,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {104051#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:36,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {104052#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104052#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:36,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {104052#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:36,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {104053#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104053#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:36,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {104053#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:36,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {104054#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104054#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:36,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {104054#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:36,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {104055#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104055#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:36,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {104055#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:36,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {104056#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104056#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:36,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {104056#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:36,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {104057#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104057#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:36,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {104057#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:36,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {104058#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104058#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:36,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {104058#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:36,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {104059#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104059#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:36,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {104059#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:36,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {104060#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104060#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:36,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {104060#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:36,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {104061#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104061#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:36,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {104061#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:36,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {104062#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104062#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:36,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {104062#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:36,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {104063#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104063#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:36,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {104063#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:36,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {104064#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104064#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:36,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {104064#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:36,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {104065#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104065#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:36,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {104065#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:36,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {104066#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104066#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:36,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {104066#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:36,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {104067#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104067#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:36,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {104067#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:36,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {104068#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104068#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:36,515 INFO L290 TraceCheckUtils]: 71: Hoare triple {104068#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:36,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {104069#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104069#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:36,515 INFO L290 TraceCheckUtils]: 73: Hoare triple {104069#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:36,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {104070#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104070#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:36,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {104070#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:36,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {104071#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104071#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:36,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {104071#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:36,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {104072#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104072#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:36,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {104072#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:36,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {104073#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104073#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:36,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {104073#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:36,518 INFO L290 TraceCheckUtils]: 82: Hoare triple {104074#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104074#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:36,519 INFO L290 TraceCheckUtils]: 83: Hoare triple {104074#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:36,519 INFO L290 TraceCheckUtils]: 84: Hoare triple {104075#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104075#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:36,519 INFO L290 TraceCheckUtils]: 85: Hoare triple {104075#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:36,519 INFO L290 TraceCheckUtils]: 86: Hoare triple {104076#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104076#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:36,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {104076#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:36,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {104077#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104077#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:36,521 INFO L290 TraceCheckUtils]: 89: Hoare triple {104077#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:36,521 INFO L290 TraceCheckUtils]: 90: Hoare triple {104078#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104078#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:36,521 INFO L290 TraceCheckUtils]: 91: Hoare triple {104078#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:36,521 INFO L290 TraceCheckUtils]: 92: Hoare triple {104079#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104079#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:36,522 INFO L290 TraceCheckUtils]: 93: Hoare triple {104079#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:36,522 INFO L290 TraceCheckUtils]: 94: Hoare triple {104080#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104080#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:36,522 INFO L290 TraceCheckUtils]: 95: Hoare triple {104080#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:36,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {104081#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104081#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:36,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {104081#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:36,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {104082#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104082#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:36,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {104082#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:36,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {104083#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104083#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:36,524 INFO L290 TraceCheckUtils]: 101: Hoare triple {104083#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:36,525 INFO L290 TraceCheckUtils]: 102: Hoare triple {104084#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104084#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:36,525 INFO L290 TraceCheckUtils]: 103: Hoare triple {104084#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:36,525 INFO L290 TraceCheckUtils]: 104: Hoare triple {104085#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104085#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:36,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {104085#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:36,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {104086#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104086#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:36,526 INFO L290 TraceCheckUtils]: 107: Hoare triple {104086#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:36,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {104087#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104087#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:36,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {104087#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:36,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {104088#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104088#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:36,528 INFO L290 TraceCheckUtils]: 111: Hoare triple {104088#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:36,528 INFO L290 TraceCheckUtils]: 112: Hoare triple {104089#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104089#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:36,528 INFO L290 TraceCheckUtils]: 113: Hoare triple {104089#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:36,529 INFO L290 TraceCheckUtils]: 114: Hoare triple {104090#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104090#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:36,529 INFO L290 TraceCheckUtils]: 115: Hoare triple {104090#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:36,529 INFO L290 TraceCheckUtils]: 116: Hoare triple {104091#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104091#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:36,530 INFO L290 TraceCheckUtils]: 117: Hoare triple {104091#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:36,530 INFO L290 TraceCheckUtils]: 118: Hoare triple {104092#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104092#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:36,530 INFO L290 TraceCheckUtils]: 119: Hoare triple {104092#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:36,531 INFO L290 TraceCheckUtils]: 120: Hoare triple {104093#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104093#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:36,531 INFO L290 TraceCheckUtils]: 121: Hoare triple {104093#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:36,531 INFO L290 TraceCheckUtils]: 122: Hoare triple {104094#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104094#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:36,532 INFO L290 TraceCheckUtils]: 123: Hoare triple {104094#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:36,532 INFO L290 TraceCheckUtils]: 124: Hoare triple {104095#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104095#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:36,532 INFO L290 TraceCheckUtils]: 125: Hoare triple {104095#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:36,533 INFO L290 TraceCheckUtils]: 126: Hoare triple {104096#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104096#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:36,533 INFO L290 TraceCheckUtils]: 127: Hoare triple {104096#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:36,533 INFO L290 TraceCheckUtils]: 128: Hoare triple {104097#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104097#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:36,534 INFO L290 TraceCheckUtils]: 129: Hoare triple {104097#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 06:05:36,534 INFO L290 TraceCheckUtils]: 130: Hoare triple {104098#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104098#(<= main_~i~0 62)} is VALID [2022-04-15 06:05:36,534 INFO L290 TraceCheckUtils]: 131: Hoare triple {104098#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104099#(<= main_~i~0 63)} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 132: Hoare triple {104099#(<= main_~i~0 63)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 06:05:36,535 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 06:05:36,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 06:05:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:05:36,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:41,252 INFO L290 TraceCheckUtils]: 145: Hoare triple {104032#false} assume !false; {104032#false} is VALID [2022-04-15 06:05:41,252 INFO L290 TraceCheckUtils]: 144: Hoare triple {104032#false} assume 0 == ~cond; {104032#false} is VALID [2022-04-15 06:05:41,252 INFO L290 TraceCheckUtils]: 143: Hoare triple {104032#false} ~cond := #in~cond; {104032#false} is VALID [2022-04-15 06:05:41,252 INFO L272 TraceCheckUtils]: 142: Hoare triple {104032#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {104032#false} is VALID [2022-04-15 06:05:41,252 INFO L290 TraceCheckUtils]: 141: Hoare triple {104032#false} assume !(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 140: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 139: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 138: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 137: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 136: Hoare triple {104032#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 135: Hoare triple {104032#false} assume !!(0 != #t~mem4);havoc #t~mem4; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 134: Hoare triple {104032#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 133: Hoare triple {104032#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {104032#false} is VALID [2022-04-15 06:05:41,253 INFO L290 TraceCheckUtils]: 132: Hoare triple {104579#(< main_~i~0 1023)} assume !(~i~0 < 1023); {104032#false} is VALID [2022-04-15 06:05:41,254 INFO L290 TraceCheckUtils]: 131: Hoare triple {104583#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(< main_~i~0 1023)} is VALID [2022-04-15 06:05:41,254 INFO L290 TraceCheckUtils]: 130: Hoare triple {104583#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -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 1022)} is VALID [2022-04-15 06:05:41,254 INFO L290 TraceCheckUtils]: 129: Hoare triple {104590#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(< main_~i~0 1022)} is VALID [2022-04-15 06:05:41,255 INFO L290 TraceCheckUtils]: 128: Hoare triple {104590#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -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 1021)} is VALID [2022-04-15 06:05:41,255 INFO L290 TraceCheckUtils]: 127: Hoare triple {104597#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(< main_~i~0 1021)} is VALID [2022-04-15 06:05:41,255 INFO L290 TraceCheckUtils]: 126: Hoare triple {104597#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -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 1020)} is VALID [2022-04-15 06:05:41,256 INFO L290 TraceCheckUtils]: 125: Hoare triple {104604#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(< main_~i~0 1020)} is VALID [2022-04-15 06:05:41,256 INFO L290 TraceCheckUtils]: 124: Hoare triple {104604#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -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 1019)} is VALID [2022-04-15 06:05:41,256 INFO L290 TraceCheckUtils]: 123: Hoare triple {104611#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(< main_~i~0 1019)} is VALID [2022-04-15 06:05:41,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {104611#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -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 1018)} is VALID [2022-04-15 06:05:41,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {104618#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(< main_~i~0 1018)} is VALID [2022-04-15 06:05:41,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {104618#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104618#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:41,258 INFO L290 TraceCheckUtils]: 119: Hoare triple {104625#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104618#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:41,258 INFO L290 TraceCheckUtils]: 118: Hoare triple {104625#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104625#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:41,258 INFO L290 TraceCheckUtils]: 117: Hoare triple {104632#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104625#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:41,259 INFO L290 TraceCheckUtils]: 116: Hoare triple {104632#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104632#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:41,259 INFO L290 TraceCheckUtils]: 115: Hoare triple {104639#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104632#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:41,259 INFO L290 TraceCheckUtils]: 114: Hoare triple {104639#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104639#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:41,260 INFO L290 TraceCheckUtils]: 113: Hoare triple {104646#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104639#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:41,260 INFO L290 TraceCheckUtils]: 112: Hoare triple {104646#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104646#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:41,260 INFO L290 TraceCheckUtils]: 111: Hoare triple {104653#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104646#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:41,261 INFO L290 TraceCheckUtils]: 110: Hoare triple {104653#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104653#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:41,261 INFO L290 TraceCheckUtils]: 109: Hoare triple {104660#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104653#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:41,261 INFO L290 TraceCheckUtils]: 108: Hoare triple {104660#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104660#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:41,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {104667#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104660#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:41,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {104667#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104667#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:41,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {104674#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104667#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:41,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {104674#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104674#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:41,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {104681#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104674#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:41,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {104681#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104681#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:41,264 INFO L290 TraceCheckUtils]: 101: Hoare triple {104688#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104681#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:41,264 INFO L290 TraceCheckUtils]: 100: Hoare triple {104688#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104688#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:41,264 INFO L290 TraceCheckUtils]: 99: Hoare triple {104695#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104688#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:41,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {104695#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104695#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:41,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {104702#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104695#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:41,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {104702#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104702#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:41,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {104709#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104702#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:41,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {104709#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104709#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:41,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {104716#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104709#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:41,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {104716#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104716#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:41,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {104723#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104716#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:41,267 INFO L290 TraceCheckUtils]: 90: Hoare triple {104723#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104723#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:41,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {104730#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104723#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:41,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {104730#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104730#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:41,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {104737#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104730#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:41,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {104737#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104737#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:41,269 INFO L290 TraceCheckUtils]: 85: Hoare triple {104744#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104737#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:41,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {104744#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104744#(< main_~i~0 999)} is VALID [2022-04-15 06:05:41,269 INFO L290 TraceCheckUtils]: 83: Hoare triple {104751#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104744#(< main_~i~0 999)} is VALID [2022-04-15 06:05:41,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {104751#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104751#(< main_~i~0 998)} is VALID [2022-04-15 06:05:41,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {104758#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104751#(< main_~i~0 998)} is VALID [2022-04-15 06:05:41,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {104758#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104758#(< main_~i~0 997)} is VALID [2022-04-15 06:05:41,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {104765#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104758#(< main_~i~0 997)} is VALID [2022-04-15 06:05:41,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {104765#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104765#(< main_~i~0 996)} is VALID [2022-04-15 06:05:41,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {104772#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104765#(< main_~i~0 996)} is VALID [2022-04-15 06:05:41,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {104772#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104772#(< main_~i~0 995)} is VALID [2022-04-15 06:05:41,272 INFO L290 TraceCheckUtils]: 75: Hoare triple {104779#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104772#(< main_~i~0 995)} is VALID [2022-04-15 06:05:41,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {104779#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104779#(< main_~i~0 994)} is VALID [2022-04-15 06:05:41,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {104786#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104779#(< main_~i~0 994)} is VALID [2022-04-15 06:05:41,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {104786#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104786#(< main_~i~0 993)} is VALID [2022-04-15 06:05:41,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {104793#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104786#(< main_~i~0 993)} is VALID [2022-04-15 06:05:41,274 INFO L290 TraceCheckUtils]: 70: Hoare triple {104793#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104793#(< main_~i~0 992)} is VALID [2022-04-15 06:05:41,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {104800#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104793#(< main_~i~0 992)} is VALID [2022-04-15 06:05:41,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {104800#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104800#(< main_~i~0 991)} is VALID [2022-04-15 06:05:41,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {104807#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104800#(< main_~i~0 991)} is VALID [2022-04-15 06:05:41,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {104807#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104807#(< main_~i~0 990)} is VALID [2022-04-15 06:05:41,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {104814#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104807#(< main_~i~0 990)} is VALID [2022-04-15 06:05:41,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {104814#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104814#(< main_~i~0 989)} is VALID [2022-04-15 06:05:41,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {104821#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104814#(< main_~i~0 989)} is VALID [2022-04-15 06:05:41,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {104821#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104821#(< main_~i~0 988)} is VALID [2022-04-15 06:05:41,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {104828#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104821#(< main_~i~0 988)} is VALID [2022-04-15 06:05:41,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {104828#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104828#(< main_~i~0 987)} is VALID [2022-04-15 06:05:41,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {104835#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104828#(< main_~i~0 987)} is VALID [2022-04-15 06:05:41,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {104835#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104835#(< main_~i~0 986)} is VALID [2022-04-15 06:05:41,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {104842#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104835#(< main_~i~0 986)} is VALID [2022-04-15 06:05:41,278 INFO L290 TraceCheckUtils]: 56: Hoare triple {104842#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104842#(< main_~i~0 985)} is VALID [2022-04-15 06:05:41,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {104849#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104842#(< main_~i~0 985)} is VALID [2022-04-15 06:05:41,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {104849#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104849#(< main_~i~0 984)} is VALID [2022-04-15 06:05:41,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {104856#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104849#(< main_~i~0 984)} is VALID [2022-04-15 06:05:41,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {104856#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104856#(< main_~i~0 983)} is VALID [2022-04-15 06:05:41,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {104863#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104856#(< main_~i~0 983)} is VALID [2022-04-15 06:05:41,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {104863#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104863#(< main_~i~0 982)} is VALID [2022-04-15 06:05:41,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {104870#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104863#(< main_~i~0 982)} is VALID [2022-04-15 06:05:41,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {104870#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104870#(< main_~i~0 981)} is VALID [2022-04-15 06:05:41,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {104877#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104870#(< main_~i~0 981)} is VALID [2022-04-15 06:05:41,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {104877#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104877#(< main_~i~0 980)} is VALID [2022-04-15 06:05:41,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {104884#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104877#(< main_~i~0 980)} is VALID [2022-04-15 06:05:41,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {104884#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104884#(< main_~i~0 979)} is VALID [2022-04-15 06:05:41,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {104891#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104884#(< main_~i~0 979)} is VALID [2022-04-15 06:05:41,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {104891#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104891#(< main_~i~0 978)} is VALID [2022-04-15 06:05:41,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {104898#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104891#(< main_~i~0 978)} is VALID [2022-04-15 06:05:41,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {104898#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104898#(< main_~i~0 977)} is VALID [2022-04-15 06:05:41,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {104905#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104898#(< main_~i~0 977)} is VALID [2022-04-15 06:05:41,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {104905#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104905#(< main_~i~0 976)} is VALID [2022-04-15 06:05:41,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {104912#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104905#(< main_~i~0 976)} is VALID [2022-04-15 06:05:41,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {104912#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104912#(< main_~i~0 975)} is VALID [2022-04-15 06:05:41,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {104919#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104912#(< main_~i~0 975)} is VALID [2022-04-15 06:05:41,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {104919#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104919#(< main_~i~0 974)} is VALID [2022-04-15 06:05:41,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {104926#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104919#(< main_~i~0 974)} is VALID [2022-04-15 06:05:41,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {104926#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104926#(< main_~i~0 973)} is VALID [2022-04-15 06:05:41,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {104933#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104926#(< main_~i~0 973)} is VALID [2022-04-15 06:05:41,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {104933#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104933#(< main_~i~0 972)} is VALID [2022-04-15 06:05:41,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {104940#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104933#(< main_~i~0 972)} is VALID [2022-04-15 06:05:41,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {104940#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104940#(< main_~i~0 971)} is VALID [2022-04-15 06:05:41,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {104947#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104940#(< main_~i~0 971)} is VALID [2022-04-15 06:05:41,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {104947#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104947#(< main_~i~0 970)} is VALID [2022-04-15 06:05:41,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {104954#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104947#(< main_~i~0 970)} is VALID [2022-04-15 06:05:41,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {104954#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104954#(< main_~i~0 969)} is VALID [2022-04-15 06:05:41,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {104961#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104954#(< main_~i~0 969)} is VALID [2022-04-15 06:05:41,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {104961#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104961#(< main_~i~0 968)} is VALID [2022-04-15 06:05:41,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {104968#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104961#(< main_~i~0 968)} is VALID [2022-04-15 06:05:41,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {104968#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104968#(< main_~i~0 967)} is VALID [2022-04-15 06:05:41,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {104975#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104968#(< main_~i~0 967)} is VALID [2022-04-15 06:05:41,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {104975#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104975#(< main_~i~0 966)} is VALID [2022-04-15 06:05:41,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {104982#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104975#(< main_~i~0 966)} is VALID [2022-04-15 06:05:41,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {104982#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104982#(< main_~i~0 965)} is VALID [2022-04-15 06:05:41,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {104989#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104982#(< main_~i~0 965)} is VALID [2022-04-15 06:05:41,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {104989#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104989#(< main_~i~0 964)} is VALID [2022-04-15 06:05:41,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {104996#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104989#(< main_~i~0 964)} is VALID [2022-04-15 06:05:41,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {104996#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104996#(< main_~i~0 963)} is VALID [2022-04-15 06:05:41,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {105003#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104996#(< main_~i~0 963)} is VALID [2022-04-15 06:05:41,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {105003#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105003#(< main_~i~0 962)} is VALID [2022-04-15 06:05:41,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {105010#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105003#(< main_~i~0 962)} is VALID [2022-04-15 06:05:41,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {105010#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105010#(< main_~i~0 961)} is VALID [2022-04-15 06:05:41,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {105017#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105010#(< main_~i~0 961)} is VALID [2022-04-15 06:05:41,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {105017#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105017#(< main_~i~0 960)} is VALID [2022-04-15 06:05:41,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {104031#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {105017#(< main_~i~0 960)} is VALID [2022-04-15 06:05:41,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {104031#true} call #t~ret5 := main(); {104031#true} is VALID [2022-04-15 06:05:41,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104031#true} {104031#true} #58#return; {104031#true} is VALID [2022-04-15 06:05:41,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {104031#true} assume true; {104031#true} is VALID [2022-04-15 06:05:41,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {104031#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(10, 2); {104031#true} is VALID [2022-04-15 06:05:41,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {104031#true} call ULTIMATE.init(); {104031#true} is VALID [2022-04-15 06:05:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:05:41,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233203774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:41,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-15 06:05:41,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:41,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509430854] [2022-04-15 06:05:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509430854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:41,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 06:05:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386894008] [2022-04-15 06:05:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:41,298 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 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 146 [2022-04-15 06:05:41,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:41,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have 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:41,387 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:05:41,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 06:05:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 06:05:41,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2022-04-15 06:05:41,390 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have 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:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:57,319 INFO L93 Difference]: Finished difference Result 413 states and 477 transitions. [2022-04-15 06:05:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 06:05:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 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 146 [2022-04-15 06:05:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have 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:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 472 transitions. [2022-04-15 06:05:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have 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:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 472 transitions. [2022-04-15 06:05:57,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 472 transitions. [2022-04-15 06:05:57,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:57,665 INFO L225 Difference]: With dead ends: 413 [2022-04-15 06:05:57,665 INFO L226 Difference]: Without dead ends: 399 [2022-04-15 06:05:57,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=16902, Invalid=21318, Unknown=0, NotChecked=0, Total=38220 [2022-04-15 06:05:57,667 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1004 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:57,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 31 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:05:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-15 06:05:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 149. [2022-04-15 06:05:58,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:58,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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:58,775 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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:58,775 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:58,781 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2022-04-15 06:05:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 462 transitions. [2022-04-15 06:05:58,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:58,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:58,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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 399 states. [2022-04-15 06:05:58,782 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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 399 states. [2022-04-15 06:05:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:58,788 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2022-04-15 06:05:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 462 transitions. [2022-04-15 06:05:58,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:58,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:58,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:58,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 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:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-15 06:05:58,790 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2022-04-15 06:05:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:58,790 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-15 06:05:58,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (3), 3 states have 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:58,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-15 06:05:59,160 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:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-15 06:05:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 06:05:59,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:59,161 INFO L499 BasicCegarLoop]: trace histogram [64, 64, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:59,179 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:05:59,361 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:05:59,361 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1879179695, now seen corresponding path program 129 times [2022-04-15 06:05:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:59,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317481705] [2022-04-15 06:05:59,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:05:59,365 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:59,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1879179695, now seen corresponding path program 130 times [2022-04-15 06:05:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237297938] [2022-04-15 06:05:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:00,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {107161#(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(10, 2); {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:00,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {107161#(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(10, 2); {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 06:06:00,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 06:06:00,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107096#(= main_~i~0 0)} is VALID [2022-04-15 06:06:00,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {107096#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107096#(= main_~i~0 0)} is VALID [2022-04-15 06:06:00,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {107096#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:00,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {107097#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:00,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {107097#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:00,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {107098#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {107098#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:00,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {107099#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:00,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {107099#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {107100#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:00,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {107100#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:00,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {107101#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:00,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {107101#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:00,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {107102#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:00,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {107102#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:00,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {107103#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:00,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {107103#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:00,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {107104#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:00,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {107104#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:00,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {107105#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:00,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {107105#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:00,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {107106#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:00,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {107106#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:00,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {107107#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:00,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {107107#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:00,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {107108#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:00,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {107108#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:00,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {107109#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:00,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {107109#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:00,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {107110#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:00,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {107110#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:00,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {107111#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:00,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {107111#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:00,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {107112#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:00,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {107112#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:00,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {107113#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:00,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {107113#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:00,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {107114#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:00,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {107114#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:00,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {107115#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:00,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {107115#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:00,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {107116#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:00,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {107116#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:00,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {107117#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:00,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {107117#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:00,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {107118#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:00,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {107118#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:00,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {107119#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:00,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {107119#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:00,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {107120#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:00,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {107120#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:00,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {107121#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:00,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {107121#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:00,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {107122#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:00,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {107122#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:00,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {107123#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:00,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {107123#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:00,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {107124#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:00,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {107124#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:00,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {107125#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:00,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {107125#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:00,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {107126#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:00,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {107126#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:00,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {107127#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:00,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {107127#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:00,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {107128#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:00,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {107128#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:00,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {107129#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:00,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {107129#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:00,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {107130#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:00,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {107130#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:00,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {107131#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:00,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {107131#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:00,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {107132#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:00,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {107132#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:00,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {107133#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:00,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {107133#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:00,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {107134#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:00,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {107134#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:00,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {107135#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:00,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {107135#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:00,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {107136#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:00,941 INFO L290 TraceCheckUtils]: 87: Hoare triple {107136#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:00,942 INFO L290 TraceCheckUtils]: 88: Hoare triple {107137#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:00,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {107137#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:00,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {107138#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:00,943 INFO L290 TraceCheckUtils]: 91: Hoare triple {107138#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:00,943 INFO L290 TraceCheckUtils]: 92: Hoare triple {107139#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:00,943 INFO L290 TraceCheckUtils]: 93: Hoare triple {107139#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:00,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {107140#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:00,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {107140#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:00,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {107141#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:00,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {107141#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:00,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {107142#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:00,945 INFO L290 TraceCheckUtils]: 99: Hoare triple {107142#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:00,945 INFO L290 TraceCheckUtils]: 100: Hoare triple {107143#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:00,946 INFO L290 TraceCheckUtils]: 101: Hoare triple {107143#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:00,946 INFO L290 TraceCheckUtils]: 102: Hoare triple {107144#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:00,946 INFO L290 TraceCheckUtils]: 103: Hoare triple {107144#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:00,947 INFO L290 TraceCheckUtils]: 104: Hoare triple {107145#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:00,947 INFO L290 TraceCheckUtils]: 105: Hoare triple {107145#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:00,947 INFO L290 TraceCheckUtils]: 106: Hoare triple {107146#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:00,948 INFO L290 TraceCheckUtils]: 107: Hoare triple {107146#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:00,948 INFO L290 TraceCheckUtils]: 108: Hoare triple {107147#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:00,948 INFO L290 TraceCheckUtils]: 109: Hoare triple {107147#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:00,949 INFO L290 TraceCheckUtils]: 110: Hoare triple {107148#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:00,949 INFO L290 TraceCheckUtils]: 111: Hoare triple {107148#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:00,949 INFO L290 TraceCheckUtils]: 112: Hoare triple {107149#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:00,950 INFO L290 TraceCheckUtils]: 113: Hoare triple {107149#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:00,950 INFO L290 TraceCheckUtils]: 114: Hoare triple {107150#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:00,950 INFO L290 TraceCheckUtils]: 115: Hoare triple {107150#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:00,951 INFO L290 TraceCheckUtils]: 116: Hoare triple {107151#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:00,951 INFO L290 TraceCheckUtils]: 117: Hoare triple {107151#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:00,951 INFO L290 TraceCheckUtils]: 118: Hoare triple {107152#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:00,952 INFO L290 TraceCheckUtils]: 119: Hoare triple {107152#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:00,952 INFO L290 TraceCheckUtils]: 120: Hoare triple {107153#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:00,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {107153#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:00,953 INFO L290 TraceCheckUtils]: 122: Hoare triple {107154#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:00,953 INFO L290 TraceCheckUtils]: 123: Hoare triple {107154#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:00,953 INFO L290 TraceCheckUtils]: 124: Hoare triple {107155#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:00,954 INFO L290 TraceCheckUtils]: 125: Hoare triple {107155#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:00,954 INFO L290 TraceCheckUtils]: 126: Hoare triple {107156#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:00,954 INFO L290 TraceCheckUtils]: 127: Hoare triple {107156#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:00,954 INFO L290 TraceCheckUtils]: 128: Hoare triple {107157#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:00,955 INFO L290 TraceCheckUtils]: 129: Hoare triple {107157#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:00,955 INFO L290 TraceCheckUtils]: 130: Hoare triple {107158#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:00,955 INFO L290 TraceCheckUtils]: 131: Hoare triple {107158#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:00,956 INFO L290 TraceCheckUtils]: 132: Hoare triple {107159#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:00,956 INFO L290 TraceCheckUtils]: 133: Hoare triple {107159#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107160#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:00,956 INFO L290 TraceCheckUtils]: 134: Hoare triple {107160#(<= main_~i~0 64)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 06:06:00,957 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 06:06:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:00,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237297938] [2022-04-15 06:06:00,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237297938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:00,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141731494] [2022-04-15 06:06:00,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:06:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:00,988 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:06:00,989 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:06:01,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:06:01,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 06:06:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:01,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:02,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107091#true} is VALID [2022-04-15 06:06:02,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#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(10, 2); {107091#true} is VALID [2022-04-15 06:06:02,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 06:06:02,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 06:06:02,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 06:06:02,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107180#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:02,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {107180#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107180#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:02,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {107180#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:02,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {107097#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107097#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:02,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {107097#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:02,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {107098#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107098#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:02,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {107098#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:02,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {107099#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107099#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:02,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {107099#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:02,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {107100#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107100#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:02,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {107100#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:02,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {107101#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107101#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:02,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {107101#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:02,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {107102#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107102#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:02,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {107102#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:02,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {107103#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107103#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:02,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {107103#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:02,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {107104#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107104#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:02,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {107104#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:02,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {107105#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107105#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:02,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {107105#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:02,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {107106#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107106#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:02,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {107106#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:02,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {107107#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107107#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:02,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {107107#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:02,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {107108#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107108#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:02,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {107108#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:02,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {107109#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107109#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:02,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {107109#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:02,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {107110#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107110#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:02,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {107110#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:02,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {107111#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107111#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:02,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {107111#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:02,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {107112#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107112#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:02,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {107112#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:02,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {107113#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107113#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:02,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {107113#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:02,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {107114#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107114#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:02,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {107114#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:02,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {107115#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107115#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:02,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {107115#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:02,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {107116#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107116#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:02,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {107116#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:02,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {107117#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107117#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:02,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {107117#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:02,578 INFO L290 TraceCheckUtils]: 50: Hoare triple {107118#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107118#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:02,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {107118#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:02,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {107119#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107119#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:02,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {107119#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:02,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {107120#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107120#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:02,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {107120#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:02,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {107121#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107121#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:02,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {107121#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:02,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {107122#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107122#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:02,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {107122#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:02,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {107123#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107123#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:02,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {107123#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:02,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {107124#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107124#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:02,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {107124#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:02,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {107125#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107125#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:02,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {107125#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:02,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {107126#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107126#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:02,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {107126#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:02,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {107127#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107127#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:02,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {107127#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:02,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {107128#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107128#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:02,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {107128#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:02,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {107129#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107129#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:02,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {107129#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:02,586 INFO L290 TraceCheckUtils]: 74: Hoare triple {107130#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107130#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:02,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {107130#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:02,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {107131#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107131#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:02,587 INFO L290 TraceCheckUtils]: 77: Hoare triple {107131#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:02,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {107132#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107132#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:02,588 INFO L290 TraceCheckUtils]: 79: Hoare triple {107132#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:02,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {107133#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107133#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:02,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {107133#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:02,589 INFO L290 TraceCheckUtils]: 82: Hoare triple {107134#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107134#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:02,589 INFO L290 TraceCheckUtils]: 83: Hoare triple {107134#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:02,589 INFO L290 TraceCheckUtils]: 84: Hoare triple {107135#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107135#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:02,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {107135#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:02,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {107136#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107136#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:02,590 INFO L290 TraceCheckUtils]: 87: Hoare triple {107136#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:02,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {107137#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107137#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:02,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {107137#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:02,591 INFO L290 TraceCheckUtils]: 90: Hoare triple {107138#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107138#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:02,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {107138#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:02,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {107139#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107139#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:02,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {107139#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:02,593 INFO L290 TraceCheckUtils]: 94: Hoare triple {107140#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107140#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:02,593 INFO L290 TraceCheckUtils]: 95: Hoare triple {107140#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:02,593 INFO L290 TraceCheckUtils]: 96: Hoare triple {107141#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107141#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:02,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {107141#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:02,594 INFO L290 TraceCheckUtils]: 98: Hoare triple {107142#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107142#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:02,594 INFO L290 TraceCheckUtils]: 99: Hoare triple {107142#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:02,595 INFO L290 TraceCheckUtils]: 100: Hoare triple {107143#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107143#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:02,595 INFO L290 TraceCheckUtils]: 101: Hoare triple {107143#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:02,595 INFO L290 TraceCheckUtils]: 102: Hoare triple {107144#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107144#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:02,596 INFO L290 TraceCheckUtils]: 103: Hoare triple {107144#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:02,596 INFO L290 TraceCheckUtils]: 104: Hoare triple {107145#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107145#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:02,596 INFO L290 TraceCheckUtils]: 105: Hoare triple {107145#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:02,597 INFO L290 TraceCheckUtils]: 106: Hoare triple {107146#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107146#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:02,597 INFO L290 TraceCheckUtils]: 107: Hoare triple {107146#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:02,597 INFO L290 TraceCheckUtils]: 108: Hoare triple {107147#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107147#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:02,598 INFO L290 TraceCheckUtils]: 109: Hoare triple {107147#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:02,598 INFO L290 TraceCheckUtils]: 110: Hoare triple {107148#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107148#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:02,598 INFO L290 TraceCheckUtils]: 111: Hoare triple {107148#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:02,599 INFO L290 TraceCheckUtils]: 112: Hoare triple {107149#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107149#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:02,599 INFO L290 TraceCheckUtils]: 113: Hoare triple {107149#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:02,599 INFO L290 TraceCheckUtils]: 114: Hoare triple {107150#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107150#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:02,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {107150#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:02,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {107151#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107151#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:02,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {107151#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:02,601 INFO L290 TraceCheckUtils]: 118: Hoare triple {107152#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107152#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:02,601 INFO L290 TraceCheckUtils]: 119: Hoare triple {107152#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:02,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {107153#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107153#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:02,602 INFO L290 TraceCheckUtils]: 121: Hoare triple {107153#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:02,602 INFO L290 TraceCheckUtils]: 122: Hoare triple {107154#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107154#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:02,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {107154#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:02,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {107155#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107155#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:02,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {107155#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:02,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {107156#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107156#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:02,604 INFO L290 TraceCheckUtils]: 127: Hoare triple {107156#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:02,604 INFO L290 TraceCheckUtils]: 128: Hoare triple {107157#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107157#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:02,604 INFO L290 TraceCheckUtils]: 129: Hoare triple {107157#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:02,604 INFO L290 TraceCheckUtils]: 130: Hoare triple {107158#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107158#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:02,605 INFO L290 TraceCheckUtils]: 131: Hoare triple {107158#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:02,605 INFO L290 TraceCheckUtils]: 132: Hoare triple {107159#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107159#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:02,605 INFO L290 TraceCheckUtils]: 133: Hoare triple {107159#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107160#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {107160#(<= main_~i~0 64)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:02,606 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:02,607 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 06:06:02,607 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 06:06:02,607 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 06:06:02,607 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 06:06:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:02,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:07,522 INFO L290 TraceCheckUtils]: 147: Hoare triple {107092#false} assume !false; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 146: Hoare triple {107092#false} assume 0 == ~cond; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 145: Hoare triple {107092#false} ~cond := #in~cond; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L272 TraceCheckUtils]: 144: Hoare triple {107092#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 143: Hoare triple {107092#false} assume !(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 142: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 141: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 140: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 139: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 138: Hoare triple {107092#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 137: Hoare triple {107092#false} assume !!(0 != #t~mem4);havoc #t~mem4; {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 136: Hoare triple {107092#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {107092#false} is VALID [2022-04-15 06:06:07,523 INFO L290 TraceCheckUtils]: 135: Hoare triple {107092#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {107092#false} is VALID [2022-04-15 06:06:07,524 INFO L290 TraceCheckUtils]: 134: Hoare triple {107646#(< main_~i~0 1023)} assume !(~i~0 < 1023); {107092#false} is VALID [2022-04-15 06:06:07,524 INFO L290 TraceCheckUtils]: 133: Hoare triple {107650#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107646#(< main_~i~0 1023)} is VALID [2022-04-15 06:06:07,524 INFO L290 TraceCheckUtils]: 132: Hoare triple {107650#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107650#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:07,525 INFO L290 TraceCheckUtils]: 131: Hoare triple {107657#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107650#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:07,525 INFO L290 TraceCheckUtils]: 130: Hoare triple {107657#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107657#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:07,526 INFO L290 TraceCheckUtils]: 129: Hoare triple {107664#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107657#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:07,526 INFO L290 TraceCheckUtils]: 128: Hoare triple {107664#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107664#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:07,526 INFO L290 TraceCheckUtils]: 127: Hoare triple {107671#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107664#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:07,527 INFO L290 TraceCheckUtils]: 126: Hoare triple {107671#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107671#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:07,527 INFO L290 TraceCheckUtils]: 125: Hoare triple {107678#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107671#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:07,527 INFO L290 TraceCheckUtils]: 124: Hoare triple {107678#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107678#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:07,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {107685#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107678#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:07,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {107685#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107685#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:07,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {107692#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107685#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:07,529 INFO L290 TraceCheckUtils]: 120: Hoare triple {107692#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107692#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:07,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {107699#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107692#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:07,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {107699#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107699#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:07,530 INFO L290 TraceCheckUtils]: 117: Hoare triple {107706#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107699#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:07,530 INFO L290 TraceCheckUtils]: 116: Hoare triple {107706#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107706#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:07,530 INFO L290 TraceCheckUtils]: 115: Hoare triple {107713#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107706#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:07,531 INFO L290 TraceCheckUtils]: 114: Hoare triple {107713#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107713#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:07,531 INFO L290 TraceCheckUtils]: 113: Hoare triple {107720#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107713#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:07,531 INFO L290 TraceCheckUtils]: 112: Hoare triple {107720#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107720#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:07,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {107727#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107720#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:07,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {107727#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107727#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:07,532 INFO L290 TraceCheckUtils]: 109: Hoare triple {107734#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107727#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:07,533 INFO L290 TraceCheckUtils]: 108: Hoare triple {107734#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107734#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:07,533 INFO L290 TraceCheckUtils]: 107: Hoare triple {107741#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107734#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:07,533 INFO L290 TraceCheckUtils]: 106: Hoare triple {107741#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107741#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:07,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {107748#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107741#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:07,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {107748#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107748#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:07,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {107755#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107748#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:07,535 INFO L290 TraceCheckUtils]: 102: Hoare triple {107755#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107755#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:07,535 INFO L290 TraceCheckUtils]: 101: Hoare triple {107762#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107755#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:07,535 INFO L290 TraceCheckUtils]: 100: Hoare triple {107762#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -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 1006)} is VALID [2022-04-15 06:06:07,536 INFO L290 TraceCheckUtils]: 99: Hoare triple {107769#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(< main_~i~0 1006)} is VALID [2022-04-15 06:06:07,536 INFO L290 TraceCheckUtils]: 98: Hoare triple {107769#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -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 1005)} is VALID [2022-04-15 06:06:07,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {107776#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(< main_~i~0 1005)} is VALID [2022-04-15 06:06:07,537 INFO L290 TraceCheckUtils]: 96: Hoare triple {107776#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -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 1004)} is VALID [2022-04-15 06:06:07,537 INFO L290 TraceCheckUtils]: 95: Hoare triple {107783#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(< main_~i~0 1004)} is VALID [2022-04-15 06:06:07,537 INFO L290 TraceCheckUtils]: 94: Hoare triple {107783#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -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 1003)} is VALID [2022-04-15 06:06:07,538 INFO L290 TraceCheckUtils]: 93: Hoare triple {107790#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(< main_~i~0 1003)} is VALID [2022-04-15 06:06:07,538 INFO L290 TraceCheckUtils]: 92: Hoare triple {107790#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -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 1002)} is VALID [2022-04-15 06:06:07,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {107797#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(< main_~i~0 1002)} is VALID [2022-04-15 06:06:07,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {107797#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -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 1001)} is VALID [2022-04-15 06:06:07,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {107804#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(< main_~i~0 1001)} is VALID [2022-04-15 06:06:07,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {107804#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -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 1000)} is VALID [2022-04-15 06:06:07,540 INFO L290 TraceCheckUtils]: 87: Hoare triple {107811#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(< main_~i~0 1000)} is VALID [2022-04-15 06:06:07,540 INFO L290 TraceCheckUtils]: 86: Hoare triple {107811#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -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 999)} is VALID [2022-04-15 06:06:07,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {107818#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(< main_~i~0 999)} is VALID [2022-04-15 06:06:07,541 INFO L290 TraceCheckUtils]: 84: Hoare triple {107818#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -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 998)} is VALID [2022-04-15 06:06:07,541 INFO L290 TraceCheckUtils]: 83: Hoare triple {107825#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(< main_~i~0 998)} is VALID [2022-04-15 06:06:07,541 INFO L290 TraceCheckUtils]: 82: Hoare triple {107825#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107825#(< main_~i~0 997)} is VALID [2022-04-15 06:06:07,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {107832#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107825#(< main_~i~0 997)} is VALID [2022-04-15 06:06:07,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {107832#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107832#(< main_~i~0 996)} is VALID [2022-04-15 06:06:07,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {107839#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107832#(< main_~i~0 996)} is VALID [2022-04-15 06:06:07,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {107839#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107839#(< main_~i~0 995)} is VALID [2022-04-15 06:06:07,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {107846#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107839#(< main_~i~0 995)} is VALID [2022-04-15 06:06:07,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {107846#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107846#(< main_~i~0 994)} is VALID [2022-04-15 06:06:07,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {107853#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107846#(< main_~i~0 994)} is VALID [2022-04-15 06:06:07,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {107853#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107853#(< main_~i~0 993)} is VALID [2022-04-15 06:06:07,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {107860#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107853#(< main_~i~0 993)} is VALID [2022-04-15 06:06:07,545 INFO L290 TraceCheckUtils]: 72: Hoare triple {107860#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107860#(< main_~i~0 992)} is VALID [2022-04-15 06:06:07,545 INFO L290 TraceCheckUtils]: 71: Hoare triple {107867#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107860#(< main_~i~0 992)} is VALID [2022-04-15 06:06:07,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {107867#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107867#(< main_~i~0 991)} is VALID [2022-04-15 06:06:07,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {107874#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107867#(< main_~i~0 991)} is VALID [2022-04-15 06:06:07,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {107874#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107874#(< main_~i~0 990)} is VALID [2022-04-15 06:06:07,546 INFO L290 TraceCheckUtils]: 67: Hoare triple {107881#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107874#(< main_~i~0 990)} is VALID [2022-04-15 06:06:07,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {107881#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107881#(< main_~i~0 989)} is VALID [2022-04-15 06:06:07,547 INFO L290 TraceCheckUtils]: 65: Hoare triple {107888#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107881#(< main_~i~0 989)} is VALID [2022-04-15 06:06:07,547 INFO L290 TraceCheckUtils]: 64: Hoare triple {107888#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107888#(< main_~i~0 988)} is VALID [2022-04-15 06:06:07,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {107895#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107888#(< main_~i~0 988)} is VALID [2022-04-15 06:06:07,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {107895#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107895#(< main_~i~0 987)} is VALID [2022-04-15 06:06:07,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {107902#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107895#(< main_~i~0 987)} is VALID [2022-04-15 06:06:07,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {107902#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107902#(< main_~i~0 986)} is VALID [2022-04-15 06:06:07,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {107909#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107902#(< main_~i~0 986)} is VALID [2022-04-15 06:06:07,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {107909#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107909#(< main_~i~0 985)} is VALID [2022-04-15 06:06:07,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {107916#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107909#(< main_~i~0 985)} is VALID [2022-04-15 06:06:07,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {107916#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107916#(< main_~i~0 984)} is VALID [2022-04-15 06:06:07,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {107923#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107916#(< main_~i~0 984)} is VALID [2022-04-15 06:06:07,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {107923#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107923#(< main_~i~0 983)} is VALID [2022-04-15 06:06:07,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {107930#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107923#(< main_~i~0 983)} is VALID [2022-04-15 06:06:07,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {107930#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107930#(< main_~i~0 982)} is VALID [2022-04-15 06:06:07,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {107937#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107930#(< main_~i~0 982)} is VALID [2022-04-15 06:06:07,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {107937#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107937#(< main_~i~0 981)} is VALID [2022-04-15 06:06:07,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {107944#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107937#(< main_~i~0 981)} is VALID [2022-04-15 06:06:07,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {107944#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107944#(< main_~i~0 980)} is VALID [2022-04-15 06:06:07,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {107951#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107944#(< main_~i~0 980)} is VALID [2022-04-15 06:06:07,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {107951#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107951#(< main_~i~0 979)} is VALID [2022-04-15 06:06:07,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {107958#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107951#(< main_~i~0 979)} is VALID [2022-04-15 06:06:07,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {107958#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107958#(< main_~i~0 978)} is VALID [2022-04-15 06:06:07,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {107965#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107958#(< main_~i~0 978)} is VALID [2022-04-15 06:06:07,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {107965#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107965#(< main_~i~0 977)} is VALID [2022-04-15 06:06:07,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {107972#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107965#(< main_~i~0 977)} is VALID [2022-04-15 06:06:07,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {107972#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107972#(< main_~i~0 976)} is VALID [2022-04-15 06:06:07,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {107979#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107972#(< main_~i~0 976)} is VALID [2022-04-15 06:06:07,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {107979#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107979#(< main_~i~0 975)} is VALID [2022-04-15 06:06:07,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {107986#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107979#(< main_~i~0 975)} is VALID [2022-04-15 06:06:07,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {107986#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107986#(< main_~i~0 974)} is VALID [2022-04-15 06:06:07,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {107993#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107986#(< main_~i~0 974)} is VALID [2022-04-15 06:06:07,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {107993#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107993#(< main_~i~0 973)} is VALID [2022-04-15 06:06:07,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {108000#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107993#(< main_~i~0 973)} is VALID [2022-04-15 06:06:07,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {108000#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108000#(< main_~i~0 972)} is VALID [2022-04-15 06:06:07,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {108007#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108000#(< main_~i~0 972)} is VALID [2022-04-15 06:06:07,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {108007#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108007#(< main_~i~0 971)} is VALID [2022-04-15 06:06:07,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {108014#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108007#(< main_~i~0 971)} is VALID [2022-04-15 06:06:07,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {108014#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108014#(< main_~i~0 970)} is VALID [2022-04-15 06:06:07,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {108021#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108014#(< main_~i~0 970)} is VALID [2022-04-15 06:06:07,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {108021#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108021#(< main_~i~0 969)} is VALID [2022-04-15 06:06:07,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {108028#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108021#(< main_~i~0 969)} is VALID [2022-04-15 06:06:07,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {108028#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108028#(< main_~i~0 968)} is VALID [2022-04-15 06:06:07,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {108035#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108028#(< main_~i~0 968)} is VALID [2022-04-15 06:06:07,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {108035#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108035#(< main_~i~0 967)} is VALID [2022-04-15 06:06:07,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {108042#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108035#(< main_~i~0 967)} is VALID [2022-04-15 06:06:07,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {108042#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108042#(< main_~i~0 966)} is VALID [2022-04-15 06:06:07,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {108049#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108042#(< main_~i~0 966)} is VALID [2022-04-15 06:06:07,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {108049#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108049#(< main_~i~0 965)} is VALID [2022-04-15 06:06:07,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {108056#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108049#(< main_~i~0 965)} is VALID [2022-04-15 06:06:07,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {108056#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108056#(< main_~i~0 964)} is VALID [2022-04-15 06:06:07,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {108063#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108056#(< main_~i~0 964)} is VALID [2022-04-15 06:06:07,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {108063#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108063#(< main_~i~0 963)} is VALID [2022-04-15 06:06:07,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {108070#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108063#(< main_~i~0 963)} is VALID [2022-04-15 06:06:07,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {108070#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108070#(< main_~i~0 962)} is VALID [2022-04-15 06:06:07,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {108077#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108070#(< main_~i~0 962)} is VALID [2022-04-15 06:06:07,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {108077#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108077#(< main_~i~0 961)} is VALID [2022-04-15 06:06:07,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {108084#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108077#(< main_~i~0 961)} is VALID [2022-04-15 06:06:07,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {108084#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108084#(< main_~i~0 960)} is VALID [2022-04-15 06:06:07,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {108091#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108084#(< main_~i~0 960)} is VALID [2022-04-15 06:06:07,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {108091#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108091#(< main_~i~0 959)} is VALID [2022-04-15 06:06:07,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {107091#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {108091#(< main_~i~0 959)} is VALID [2022-04-15 06:06:07,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {107091#true} call #t~ret5 := main(); {107091#true} is VALID [2022-04-15 06:06:07,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107091#true} {107091#true} #58#return; {107091#true} is VALID [2022-04-15 06:06:07,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {107091#true} assume true; {107091#true} is VALID [2022-04-15 06:06:07,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {107091#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(10, 2); {107091#true} is VALID [2022-04-15 06:06:07,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {107091#true} call ULTIMATE.init(); {107091#true} is VALID [2022-04-15 06:06:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4103 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:07,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141731494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:07,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:07,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-15 06:06:07,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317481705] [2022-04-15 06:06:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317481705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 06:06:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402486947] [2022-04-15 06:06:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 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 148 [2022-04-15 06:06:07,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:07,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have 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:07,674 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:06:07,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 06:06:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 06:06:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 06:06:07,676 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have 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:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:24,321 INFO L93 Difference]: Finished difference Result 419 states and 484 transitions. [2022-04-15 06:06:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 06:06:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 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 148 [2022-04-15 06:06:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have 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:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 479 transitions. [2022-04-15 06:06:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have 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:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 479 transitions. [2022-04-15 06:06:24,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 479 transitions. [2022-04-15 06:06:24,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:24,675 INFO L225 Difference]: With dead ends: 419 [2022-04-15 06:06:24,676 INFO L226 Difference]: Without dead ends: 405 [2022-04-15 06:06:24,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=17426, Invalid=21976, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 06:06:24,678 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1084 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:24,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1084 Valid, 31 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:06:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-15 06:06:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 151. [2022-04-15 06:06:25,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:25,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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:25,843 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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:25,843 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:25,849 INFO L93 Difference]: Finished difference Result 405 states and 469 transitions. [2022-04-15 06:06:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 469 transitions. [2022-04-15 06:06:25,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:25,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:25,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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 405 states. [2022-04-15 06:06:25,850 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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 405 states. [2022-04-15 06:06:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:25,856 INFO L93 Difference]: Finished difference Result 405 states and 469 transitions. [2022-04-15 06:06:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 469 transitions. [2022-04-15 06:06:25,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:25,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:25,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:25,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 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:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-04-15 06:06:25,858 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2022-04-15 06:06:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:25,858 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-04-15 06:06:25,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 67 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have 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:25,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 152 transitions. [2022-04-15 06:06:26,244 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:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-04-15 06:06:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 06:06:26,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:26,245 INFO L499 BasicCegarLoop]: trace histogram [65, 65, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:26,264 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:06:26,445 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:06:26,446 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash 243077329, now seen corresponding path program 131 times [2022-04-15 06:06:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:26,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971150939] [2022-04-15 06:06:26,449 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:26,449 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:06:26,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:06:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 243077329, now seen corresponding path program 132 times [2022-04-15 06:06:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:26,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433973745] [2022-04-15 06:06:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:26,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:28,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {110266#(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(10, 2); {110195#true} is VALID [2022-04-15 06:06:28,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 06:06:28,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 06:06:28,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110266#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:28,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {110266#(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(10, 2); {110195#true} is VALID [2022-04-15 06:06:28,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 06:06:28,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 06:06:28,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 06:06:28,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110200#(= main_~i~0 0)} is VALID [2022-04-15 06:06:28,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {110200#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110200#(= main_~i~0 0)} is VALID [2022-04-15 06:06:28,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {110200#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:28,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {110201#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:28,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {110201#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:28,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {110202#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:28,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {110202#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110203#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:28,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {110203#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110203#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:28,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {110203#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110204#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:28,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {110204#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110204#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:28,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {110204#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110205#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:28,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {110205#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110205#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:28,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {110205#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110206#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:28,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {110206#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110206#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:28,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {110206#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110207#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:28,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {110207#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110207#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:28,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {110207#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110208#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:28,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {110208#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110208#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:28,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {110208#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110209#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:28,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {110209#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110209#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:28,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {110209#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110210#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:28,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {110210#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110210#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:28,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {110210#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110211#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:28,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {110211#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110211#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:28,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {110211#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110212#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:28,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {110212#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110212#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:28,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {110212#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110213#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:28,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {110213#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110213#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:28,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {110213#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110214#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:28,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {110214#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110214#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:28,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {110214#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110215#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:28,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {110215#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110215#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:28,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {110215#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110216#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:28,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {110216#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110216#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:28,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {110216#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110217#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:28,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {110217#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110217#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:28,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {110217#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110218#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:28,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {110218#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110218#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:28,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {110218#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110219#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:28,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {110219#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110219#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:28,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {110219#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110220#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:28,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {110220#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110220#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:28,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {110220#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110221#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:28,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {110221#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110221#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:28,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {110221#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110222#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:28,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {110222#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110222#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:28,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {110222#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110223#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:28,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {110223#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110223#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:28,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {110223#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110224#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:28,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {110224#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110224#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:28,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {110224#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110225#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:28,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {110225#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110225#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:28,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {110225#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110226#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:28,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {110226#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110226#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:28,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {110226#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110227#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:28,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {110227#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110227#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:28,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {110227#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110228#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:28,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {110228#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110228#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:28,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {110228#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110229#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:28,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {110229#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110229#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:28,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {110229#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110230#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:28,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {110230#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110230#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:28,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {110230#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110231#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:28,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {110231#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110231#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:28,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {110231#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110232#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:28,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {110232#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110232#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:28,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {110232#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110233#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:28,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {110233#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110233#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:28,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {110233#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110234#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:28,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {110234#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110234#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:28,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {110234#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110235#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:28,074 INFO L290 TraceCheckUtils]: 76: Hoare triple {110235#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110235#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:28,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {110235#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110236#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:28,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {110236#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110236#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:28,075 INFO L290 TraceCheckUtils]: 79: Hoare triple {110236#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110237#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:28,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {110237#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110237#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:28,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {110237#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110238#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:28,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {110238#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110238#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:28,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {110238#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110239#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:28,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {110239#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110239#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:28,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {110239#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110240#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:28,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {110240#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110240#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:28,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {110240#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110241#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:28,078 INFO L290 TraceCheckUtils]: 88: Hoare triple {110241#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110241#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:28,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {110241#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110242#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:28,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {110242#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110242#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:28,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {110242#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110243#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:28,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {110243#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110243#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:28,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {110243#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110244#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:28,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {110244#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110244#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:28,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {110244#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110245#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:28,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {110245#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110245#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:28,081 INFO L290 TraceCheckUtils]: 97: Hoare triple {110245#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110246#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:28,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {110246#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110246#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:28,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {110246#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110247#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:28,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {110247#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110247#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:28,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {110247#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110248#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:28,083 INFO L290 TraceCheckUtils]: 102: Hoare triple {110248#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110248#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:28,083 INFO L290 TraceCheckUtils]: 103: Hoare triple {110248#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110249#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:28,083 INFO L290 TraceCheckUtils]: 104: Hoare triple {110249#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110249#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:28,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {110249#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110250#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:28,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {110250#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110250#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:28,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {110250#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110251#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:28,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {110251#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110251#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:28,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {110251#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110252#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:28,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {110252#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110252#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:28,086 INFO L290 TraceCheckUtils]: 111: Hoare triple {110252#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110253#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:28,086 INFO L290 TraceCheckUtils]: 112: Hoare triple {110253#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110253#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:28,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {110253#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110254#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:28,087 INFO L290 TraceCheckUtils]: 114: Hoare triple {110254#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110254#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:28,087 INFO L290 TraceCheckUtils]: 115: Hoare triple {110254#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110255#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:28,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {110255#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110255#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:28,088 INFO L290 TraceCheckUtils]: 117: Hoare triple {110255#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110256#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:28,088 INFO L290 TraceCheckUtils]: 118: Hoare triple {110256#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110256#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:28,088 INFO L290 TraceCheckUtils]: 119: Hoare triple {110256#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110257#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:28,089 INFO L290 TraceCheckUtils]: 120: Hoare triple {110257#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110257#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:28,089 INFO L290 TraceCheckUtils]: 121: Hoare triple {110257#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110258#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:28,089 INFO L290 TraceCheckUtils]: 122: Hoare triple {110258#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110258#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:28,090 INFO L290 TraceCheckUtils]: 123: Hoare triple {110258#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110259#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:28,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {110259#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110259#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:28,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {110259#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110260#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:28,091 INFO L290 TraceCheckUtils]: 126: Hoare triple {110260#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110260#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:28,091 INFO L290 TraceCheckUtils]: 127: Hoare triple {110260#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110261#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:28,091 INFO L290 TraceCheckUtils]: 128: Hoare triple {110261#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110261#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:28,092 INFO L290 TraceCheckUtils]: 129: Hoare triple {110261#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110262#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:28,092 INFO L290 TraceCheckUtils]: 130: Hoare triple {110262#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110262#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:28,092 INFO L290 TraceCheckUtils]: 131: Hoare triple {110262#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110263#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:28,093 INFO L290 TraceCheckUtils]: 132: Hoare triple {110263#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110263#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:28,093 INFO L290 TraceCheckUtils]: 133: Hoare triple {110263#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110264#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:28,093 INFO L290 TraceCheckUtils]: 134: Hoare triple {110264#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110264#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 135: Hoare triple {110264#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110265#(<= main_~i~0 65)} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 136: Hoare triple {110265#(<= main_~i~0 65)} assume !(~i~0 < 1023); {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 137: Hoare triple {110196#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 138: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 139: Hoare triple {110196#false} assume !!(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 140: Hoare triple {110196#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 141: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 142: Hoare triple {110196#false} assume !!(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 143: Hoare triple {110196#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110196#false} is VALID [2022-04-15 06:06:28,094 INFO L290 TraceCheckUtils]: 144: Hoare triple {110196#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L290 TraceCheckUtils]: 145: Hoare triple {110196#false} assume !(0 != #t~mem4);havoc #t~mem4; {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L272 TraceCheckUtils]: 146: Hoare triple {110196#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L290 TraceCheckUtils]: 147: Hoare triple {110196#false} ~cond := #in~cond; {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L290 TraceCheckUtils]: 148: Hoare triple {110196#false} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 06:06:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:28,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433973745] [2022-04-15 06:06:28,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433973745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:28,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598808895] [2022-04-15 06:06:28,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:06:28,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:28,097 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:06:28,097 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:06:28,548 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:06:28,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:28,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:06:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:28,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#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(10, 2); {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 71: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,917 INFO L290 TraceCheckUtils]: 73: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 76: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 77: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 78: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 79: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 81: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 82: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 83: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 84: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 86: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 87: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 89: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 90: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 91: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 92: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 93: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 94: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 95: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 96: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 97: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 98: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 99: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 104: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 105: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 106: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 107: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 108: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 111: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 112: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 113: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 114: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 115: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 116: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,920 INFO L290 TraceCheckUtils]: 117: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 118: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 119: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 120: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 121: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 122: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 123: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 124: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 125: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 126: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 127: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 128: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 129: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 130: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 131: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,921 INFO L290 TraceCheckUtils]: 132: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 133: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 134: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 135: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 136: Hoare triple {110195#true} assume !(~i~0 < 1023); {110195#true} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 137: Hoare triple {110195#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110681#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:28,922 INFO L290 TraceCheckUtils]: 138: Hoare triple {110681#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110681#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:28,923 INFO L290 TraceCheckUtils]: 139: Hoare triple {110681#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {110681#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:28,923 INFO L290 TraceCheckUtils]: 140: Hoare triple {110681#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:28,923 INFO L290 TraceCheckUtils]: 141: Hoare triple {110201#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110201#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:28,924 INFO L290 TraceCheckUtils]: 142: Hoare triple {110201#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {110201#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:28,924 INFO L290 TraceCheckUtils]: 143: Hoare triple {110201#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:28,924 INFO L290 TraceCheckUtils]: 144: Hoare triple {110202#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110202#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:28,925 INFO L290 TraceCheckUtils]: 145: Hoare triple {110202#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {110202#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:28,925 INFO L272 TraceCheckUtils]: 146: Hoare triple {110202#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:28,925 INFO L290 TraceCheckUtils]: 147: Hoare triple {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:06:28,926 INFO L290 TraceCheckUtils]: 148: Hoare triple {110713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 06:06:28,926 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 06:06:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 06:06:28,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:29,323 INFO L290 TraceCheckUtils]: 149: Hoare triple {110196#false} assume !false; {110196#false} is VALID [2022-04-15 06:06:29,324 INFO L290 TraceCheckUtils]: 148: Hoare triple {110713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110196#false} is VALID [2022-04-15 06:06:29,324 INFO L290 TraceCheckUtils]: 147: Hoare triple {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:06:29,325 INFO L272 TraceCheckUtils]: 146: Hoare triple {110729#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {110709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:29,325 INFO L290 TraceCheckUtils]: 145: Hoare triple {110729#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 06:06:29,325 INFO L290 TraceCheckUtils]: 144: Hoare triple {110729#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 06:06:29,326 INFO L290 TraceCheckUtils]: 143: Hoare triple {110739#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110729#(<= main_~i~0 1024)} is VALID [2022-04-15 06:06:29,326 INFO L290 TraceCheckUtils]: 142: Hoare triple {110739#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 06:06:29,326 INFO L290 TraceCheckUtils]: 141: Hoare triple {110739#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 06:06:29,327 INFO L290 TraceCheckUtils]: 140: Hoare triple {110749#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {110739#(<= main_~i~0 1023)} is VALID [2022-04-15 06:06:29,327 INFO L290 TraceCheckUtils]: 139: Hoare triple {110749#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 06:06:29,327 INFO L290 TraceCheckUtils]: 138: Hoare triple {110749#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 137: Hoare triple {110195#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {110749#(<= main_~i~0 1022)} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 136: Hoare triple {110195#true} assume !(~i~0 < 1023); {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 135: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 134: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 133: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 132: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 131: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 130: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 129: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 128: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 127: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 126: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 125: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 124: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,328 INFO L290 TraceCheckUtils]: 123: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 122: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 121: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 120: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 119: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 118: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 117: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 116: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 115: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 114: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 113: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 112: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 111: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 110: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 109: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,329 INFO L290 TraceCheckUtils]: 108: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 107: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 104: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 103: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 102: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 101: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 100: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 99: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 98: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 95: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,330 INFO L290 TraceCheckUtils]: 94: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 90: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 87: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 86: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 85: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 84: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 83: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 73: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 72: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 60: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {110195#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {110195#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {110195#true} is VALID [2022-04-15 06:06:29,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {110195#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {110195#true} call #t~ret5 := main(); {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110195#true} {110195#true} #58#return; {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {110195#true} assume true; {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {110195#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(10, 2); {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {110195#true} call ULTIMATE.init(); {110195#true} is VALID [2022-04-15 06:06:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 06:06:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598808895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:29,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:29,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 75 [2022-04-15 06:06:29,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971150939] [2022-04-15 06:06:29,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971150939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:29,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:29,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:06:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958934919] [2022-04-15 06:06:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:29,338 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 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 150 [2022-04-15 06:06:29,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:29,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have 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:29,433 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:06:29,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:06:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:29,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:06:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2562, Invalid=2988, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:06:29,435 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have 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:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:46,283 INFO L93 Difference]: Finished difference Result 425 states and 491 transitions. [2022-04-15 06:06:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:06:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 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 150 [2022-04-15 06:06:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have 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:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 486 transitions. [2022-04-15 06:06:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have 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:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 486 transitions. [2022-04-15 06:06:46,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 486 transitions. [2022-04-15 06:06:46,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:46,640 INFO L225 Difference]: With dead ends: 425 [2022-04-15 06:06:46,641 INFO L226 Difference]: Without dead ends: 411 [2022-04-15 06:06:46,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7315, Invalid=12425, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 06:06:46,642 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 985 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:46,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 51 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:06:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-15 06:06:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 153. [2022-04-15 06:06:47,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:47,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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:47,809 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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:47,809 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:47,816 INFO L93 Difference]: Finished difference Result 411 states and 476 transitions. [2022-04-15 06:06:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 476 transitions. [2022-04-15 06:06:47,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:47,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:47,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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 411 states. [2022-04-15 06:06:47,816 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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 411 states. [2022-04-15 06:06:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:47,823 INFO L93 Difference]: Finished difference Result 411 states and 476 transitions. [2022-04-15 06:06:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 476 transitions. [2022-04-15 06:06:47,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:47,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:47,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:47,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 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:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2022-04-15 06:06:47,825 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2022-04-15 06:06:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:47,825 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2022-04-15 06:06:47,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have 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:47,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 154 transitions. [2022-04-15 06:06:48,210 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:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2022-04-15 06:06:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 06:06:48,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:48,211 INFO L499 BasicCegarLoop]: trace histogram [66, 66, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:48,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-04-15 06:06:48,415 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:06:48,415 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash -93266061, now seen corresponding path program 133 times [2022-04-15 06:06:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:48,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422693643] [2022-04-15 06:06:48,419 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:48,419 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:06:48,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:06:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash -93266061, now seen corresponding path program 134 times [2022-04-15 06:06:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010301561] [2022-04-15 06:06:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:50,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {113354#(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(10, 2); {113282#true} is VALID [2022-04-15 06:06:50,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 06:06:50,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 06:06:50,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:50,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {113354#(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(10, 2); {113282#true} is VALID [2022-04-15 06:06:50,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 06:06:50,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 06:06:50,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 06:06:50,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {113287#(= main_~i~0 0)} is VALID [2022-04-15 06:06:50,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {113287#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113287#(= main_~i~0 0)} is VALID [2022-04-15 06:06:50,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {113287#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:50,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {113288#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:50,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {113288#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:50,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {113289#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:50,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {113289#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:50,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {113290#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:50,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {113290#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:50,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:50,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:50,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {113292#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:50,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {113292#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:50,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {113293#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:50,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {113293#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:50,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {113294#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:50,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {113294#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:50,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {113295#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:50,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {113295#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:50,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {113296#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:50,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {113296#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:50,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {113297#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:50,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {113297#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:50,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {113298#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:50,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {113298#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:50,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {113299#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:50,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {113299#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:50,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {113300#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:50,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {113300#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:50,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {113301#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:50,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {113301#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:50,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {113302#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:50,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {113302#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:50,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {113303#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:50,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {113303#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:50,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {113304#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:50,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {113304#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:50,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {113305#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:50,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {113305#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:50,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {113306#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:50,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {113306#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:50,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {113307#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:50,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {113307#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:50,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {113308#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:50,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {113308#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:50,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {113309#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:50,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {113309#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:50,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {113310#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:50,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {113310#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:50,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {113311#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:50,084 INFO L290 TraceCheckUtils]: 55: Hoare triple {113311#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:50,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {113312#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:50,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {113312#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:50,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {113313#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:50,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {113313#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:50,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {113314#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:50,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {113314#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:50,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {113315#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:50,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {113315#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:50,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {113316#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:50,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {113316#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:50,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {113317#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:50,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {113317#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:50,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {113318#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:50,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {113318#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:50,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {113319#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:50,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {113319#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:50,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {113320#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:50,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {113320#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:50,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {113321#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:50,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {113321#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:50,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {113322#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:50,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {113322#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:50,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {113323#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:50,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {113323#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:50,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {113324#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:50,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {113324#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:50,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {113325#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:50,093 INFO L290 TraceCheckUtils]: 83: Hoare triple {113325#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:50,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {113326#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:50,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {113326#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:50,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {113327#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:50,094 INFO L290 TraceCheckUtils]: 87: Hoare triple {113327#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:50,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {113328#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:50,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {113328#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:50,095 INFO L290 TraceCheckUtils]: 90: Hoare triple {113329#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:50,096 INFO L290 TraceCheckUtils]: 91: Hoare triple {113329#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:50,096 INFO L290 TraceCheckUtils]: 92: Hoare triple {113330#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:50,096 INFO L290 TraceCheckUtils]: 93: Hoare triple {113330#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:50,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {113331#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:50,097 INFO L290 TraceCheckUtils]: 95: Hoare triple {113331#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:50,097 INFO L290 TraceCheckUtils]: 96: Hoare triple {113332#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:50,098 INFO L290 TraceCheckUtils]: 97: Hoare triple {113332#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:50,098 INFO L290 TraceCheckUtils]: 98: Hoare triple {113333#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:50,098 INFO L290 TraceCheckUtils]: 99: Hoare triple {113333#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:50,099 INFO L290 TraceCheckUtils]: 100: Hoare triple {113334#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:50,099 INFO L290 TraceCheckUtils]: 101: Hoare triple {113334#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:50,099 INFO L290 TraceCheckUtils]: 102: Hoare triple {113335#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:50,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {113335#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:50,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {113336#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:50,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {113336#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:50,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {113337#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:50,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {113337#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:50,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {113338#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:50,102 INFO L290 TraceCheckUtils]: 109: Hoare triple {113338#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:50,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {113339#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:50,102 INFO L290 TraceCheckUtils]: 111: Hoare triple {113339#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:50,103 INFO L290 TraceCheckUtils]: 112: Hoare triple {113340#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:50,103 INFO L290 TraceCheckUtils]: 113: Hoare triple {113340#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:50,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {113341#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:50,104 INFO L290 TraceCheckUtils]: 115: Hoare triple {113341#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:50,104 INFO L290 TraceCheckUtils]: 116: Hoare triple {113342#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:50,104 INFO L290 TraceCheckUtils]: 117: Hoare triple {113342#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:50,104 INFO L290 TraceCheckUtils]: 118: Hoare triple {113343#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:50,105 INFO L290 TraceCheckUtils]: 119: Hoare triple {113343#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:50,105 INFO L290 TraceCheckUtils]: 120: Hoare triple {113344#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:50,106 INFO L290 TraceCheckUtils]: 121: Hoare triple {113344#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:50,106 INFO L290 TraceCheckUtils]: 122: Hoare triple {113345#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:50,106 INFO L290 TraceCheckUtils]: 123: Hoare triple {113345#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:50,106 INFO L290 TraceCheckUtils]: 124: Hoare triple {113346#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:50,107 INFO L290 TraceCheckUtils]: 125: Hoare triple {113346#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:50,107 INFO L290 TraceCheckUtils]: 126: Hoare triple {113347#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:50,107 INFO L290 TraceCheckUtils]: 127: Hoare triple {113347#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:50,108 INFO L290 TraceCheckUtils]: 128: Hoare triple {113348#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:50,108 INFO L290 TraceCheckUtils]: 129: Hoare triple {113348#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:50,108 INFO L290 TraceCheckUtils]: 130: Hoare triple {113349#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:50,109 INFO L290 TraceCheckUtils]: 131: Hoare triple {113349#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:50,109 INFO L290 TraceCheckUtils]: 132: Hoare triple {113350#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:50,109 INFO L290 TraceCheckUtils]: 133: Hoare triple {113350#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:50,110 INFO L290 TraceCheckUtils]: 134: Hoare triple {113351#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:50,110 INFO L290 TraceCheckUtils]: 135: Hoare triple {113351#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 06:06:50,110 INFO L290 TraceCheckUtils]: 136: Hoare triple {113352#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 137: Hoare triple {113352#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113353#(<= main_~i~0 66)} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 138: Hoare triple {113353#(<= main_~i~0 66)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:50,111 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 06:06:50,112 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 06:06:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:50,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010301561] [2022-04-15 06:06:50,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010301561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:50,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647656897] [2022-04-15 06:06:50,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:06:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:50,114 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:06:50,117 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:06:50,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:06:50,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:50,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 06:06:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:50,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:51,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113282#true} is VALID [2022-04-15 06:06:51,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#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(10, 2); {113282#true} is VALID [2022-04-15 06:06:51,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 06:06:51,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 06:06:51,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 06:06:51,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {113373#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:51,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {113373#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113373#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:51,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {113373#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:51,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {113288#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113288#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:51,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {113288#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:51,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {113289#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113289#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:51,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {113289#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:51,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {113290#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113290#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:51,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {113290#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:51,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113291#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:51,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:51,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {113292#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113292#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:51,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {113292#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:51,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {113293#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113293#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:51,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {113293#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:51,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {113294#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113294#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:51,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {113294#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:51,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {113295#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113295#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:51,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {113295#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:51,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {113296#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113296#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:51,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {113296#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:51,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {113297#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113297#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:51,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {113297#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:51,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {113298#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113298#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:51,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {113298#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:51,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {113299#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113299#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:51,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {113299#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:51,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {113300#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113300#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:51,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {113300#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:51,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {113301#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113301#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:51,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {113301#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:51,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {113302#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113302#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:51,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {113302#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:51,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {113303#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113303#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:51,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {113303#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:51,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {113304#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113304#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:51,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {113304#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:51,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {113305#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113305#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:51,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {113305#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:51,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {113306#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113306#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:51,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {113306#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:51,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {113307#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113307#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:51,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {113307#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:51,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {113308#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113308#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:51,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {113308#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:51,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {113309#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113309#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:51,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {113309#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:51,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {113310#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113310#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:51,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {113310#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:51,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {113311#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113311#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:51,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {113311#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:51,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {113312#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113312#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:51,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {113312#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:51,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {113313#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113313#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:51,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {113313#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:51,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {113314#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113314#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:51,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {113314#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:51,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {113315#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113315#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:51,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {113315#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:51,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {113316#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113316#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:51,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {113316#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:51,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {113317#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113317#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:51,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {113317#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:51,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {113318#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113318#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:51,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {113318#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:51,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {113319#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113319#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:51,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {113319#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:51,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {113320#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113320#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:51,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {113320#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:51,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {113321#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113321#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:51,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {113321#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:51,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {113322#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113322#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:51,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {113322#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:51,542 INFO L290 TraceCheckUtils]: 78: Hoare triple {113323#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113323#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:51,543 INFO L290 TraceCheckUtils]: 79: Hoare triple {113323#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:51,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {113324#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113324#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:51,543 INFO L290 TraceCheckUtils]: 81: Hoare triple {113324#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:51,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {113325#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113325#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:51,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {113325#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:51,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {113326#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113326#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:51,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {113326#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:51,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {113327#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113327#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:51,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {113327#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:51,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {113328#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113328#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:51,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {113328#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:51,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {113329#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113329#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:51,547 INFO L290 TraceCheckUtils]: 91: Hoare triple {113329#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:51,547 INFO L290 TraceCheckUtils]: 92: Hoare triple {113330#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113330#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:51,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {113330#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:51,548 INFO L290 TraceCheckUtils]: 94: Hoare triple {113331#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113331#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:51,548 INFO L290 TraceCheckUtils]: 95: Hoare triple {113331#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:51,548 INFO L290 TraceCheckUtils]: 96: Hoare triple {113332#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113332#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:51,549 INFO L290 TraceCheckUtils]: 97: Hoare triple {113332#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:51,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {113333#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113333#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:51,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {113333#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:51,550 INFO L290 TraceCheckUtils]: 100: Hoare triple {113334#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113334#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:51,550 INFO L290 TraceCheckUtils]: 101: Hoare triple {113334#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:51,550 INFO L290 TraceCheckUtils]: 102: Hoare triple {113335#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113335#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:51,551 INFO L290 TraceCheckUtils]: 103: Hoare triple {113335#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:51,551 INFO L290 TraceCheckUtils]: 104: Hoare triple {113336#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113336#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:51,551 INFO L290 TraceCheckUtils]: 105: Hoare triple {113336#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:51,552 INFO L290 TraceCheckUtils]: 106: Hoare triple {113337#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113337#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:51,552 INFO L290 TraceCheckUtils]: 107: Hoare triple {113337#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:51,552 INFO L290 TraceCheckUtils]: 108: Hoare triple {113338#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113338#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:51,553 INFO L290 TraceCheckUtils]: 109: Hoare triple {113338#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:51,553 INFO L290 TraceCheckUtils]: 110: Hoare triple {113339#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113339#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:51,553 INFO L290 TraceCheckUtils]: 111: Hoare triple {113339#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:51,554 INFO L290 TraceCheckUtils]: 112: Hoare triple {113340#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113340#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:51,554 INFO L290 TraceCheckUtils]: 113: Hoare triple {113340#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:51,554 INFO L290 TraceCheckUtils]: 114: Hoare triple {113341#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113341#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:51,555 INFO L290 TraceCheckUtils]: 115: Hoare triple {113341#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:51,555 INFO L290 TraceCheckUtils]: 116: Hoare triple {113342#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113342#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:51,555 INFO L290 TraceCheckUtils]: 117: Hoare triple {113342#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:51,556 INFO L290 TraceCheckUtils]: 118: Hoare triple {113343#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113343#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:51,556 INFO L290 TraceCheckUtils]: 119: Hoare triple {113343#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:51,556 INFO L290 TraceCheckUtils]: 120: Hoare triple {113344#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113344#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:51,557 INFO L290 TraceCheckUtils]: 121: Hoare triple {113344#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:51,557 INFO L290 TraceCheckUtils]: 122: Hoare triple {113345#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113345#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:51,557 INFO L290 TraceCheckUtils]: 123: Hoare triple {113345#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:51,557 INFO L290 TraceCheckUtils]: 124: Hoare triple {113346#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113346#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:51,558 INFO L290 TraceCheckUtils]: 125: Hoare triple {113346#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:51,558 INFO L290 TraceCheckUtils]: 126: Hoare triple {113347#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113347#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:51,558 INFO L290 TraceCheckUtils]: 127: Hoare triple {113347#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:51,559 INFO L290 TraceCheckUtils]: 128: Hoare triple {113348#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113348#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:51,559 INFO L290 TraceCheckUtils]: 129: Hoare triple {113348#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:51,559 INFO L290 TraceCheckUtils]: 130: Hoare triple {113349#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113349#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:51,560 INFO L290 TraceCheckUtils]: 131: Hoare triple {113349#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:51,560 INFO L290 TraceCheckUtils]: 132: Hoare triple {113350#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113350#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:51,560 INFO L290 TraceCheckUtils]: 133: Hoare triple {113350#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:51,561 INFO L290 TraceCheckUtils]: 134: Hoare triple {113351#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113351#(<= main_~i~0 64)} is VALID [2022-04-15 06:06:51,561 INFO L290 TraceCheckUtils]: 135: Hoare triple {113351#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 06:06:51,561 INFO L290 TraceCheckUtils]: 136: Hoare triple {113352#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113352#(<= main_~i~0 65)} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 137: Hoare triple {113352#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113353#(<= main_~i~0 66)} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 138: Hoare triple {113353#(<= main_~i~0 66)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:51,562 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 06:06:51,563 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 06:06:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:51,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 151: Hoare triple {113283#false} assume !false; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 150: Hoare triple {113283#false} assume 0 == ~cond; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 149: Hoare triple {113283#false} ~cond := #in~cond; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L272 TraceCheckUtils]: 148: Hoare triple {113283#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 147: Hoare triple {113283#false} assume !(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 146: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 145: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 144: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 143: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:56,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {113283#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {113283#false} is VALID [2022-04-15 06:06:56,550 INFO L290 TraceCheckUtils]: 141: Hoare triple {113283#false} assume !!(0 != #t~mem4);havoc #t~mem4; {113283#false} is VALID [2022-04-15 06:06:56,550 INFO L290 TraceCheckUtils]: 140: Hoare triple {113283#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {113283#false} is VALID [2022-04-15 06:06:56,550 INFO L290 TraceCheckUtils]: 139: Hoare triple {113283#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {113283#false} is VALID [2022-04-15 06:06:56,550 INFO L290 TraceCheckUtils]: 138: Hoare triple {113851#(< main_~i~0 1023)} assume !(~i~0 < 1023); {113283#false} is VALID [2022-04-15 06:06:56,550 INFO L290 TraceCheckUtils]: 137: Hoare triple {113855#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113851#(< main_~i~0 1023)} is VALID [2022-04-15 06:06:56,551 INFO L290 TraceCheckUtils]: 136: Hoare triple {113855#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113855#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:56,551 INFO L290 TraceCheckUtils]: 135: Hoare triple {113862#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113855#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:56,551 INFO L290 TraceCheckUtils]: 134: Hoare triple {113862#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113862#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:56,552 INFO L290 TraceCheckUtils]: 133: Hoare triple {113869#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113862#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:56,552 INFO L290 TraceCheckUtils]: 132: Hoare triple {113869#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113869#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:56,552 INFO L290 TraceCheckUtils]: 131: Hoare triple {113876#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113869#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:56,553 INFO L290 TraceCheckUtils]: 130: Hoare triple {113876#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113876#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:56,553 INFO L290 TraceCheckUtils]: 129: Hoare triple {113883#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113876#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:56,553 INFO L290 TraceCheckUtils]: 128: Hoare triple {113883#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113883#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:56,554 INFO L290 TraceCheckUtils]: 127: Hoare triple {113890#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113883#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:56,554 INFO L290 TraceCheckUtils]: 126: Hoare triple {113890#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113890#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:56,554 INFO L290 TraceCheckUtils]: 125: Hoare triple {113897#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113890#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:56,555 INFO L290 TraceCheckUtils]: 124: Hoare triple {113897#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113897#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:56,555 INFO L290 TraceCheckUtils]: 123: Hoare triple {113904#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113897#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:56,555 INFO L290 TraceCheckUtils]: 122: Hoare triple {113904#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113904#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:56,556 INFO L290 TraceCheckUtils]: 121: Hoare triple {113911#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113904#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:56,556 INFO L290 TraceCheckUtils]: 120: Hoare triple {113911#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113911#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:56,556 INFO L290 TraceCheckUtils]: 119: Hoare triple {113918#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113911#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:56,557 INFO L290 TraceCheckUtils]: 118: Hoare triple {113918#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113918#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:56,557 INFO L290 TraceCheckUtils]: 117: Hoare triple {113925#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113918#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:56,557 INFO L290 TraceCheckUtils]: 116: Hoare triple {113925#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113925#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:56,558 INFO L290 TraceCheckUtils]: 115: Hoare triple {113932#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113925#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:56,558 INFO L290 TraceCheckUtils]: 114: Hoare triple {113932#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113932#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:56,558 INFO L290 TraceCheckUtils]: 113: Hoare triple {113939#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113932#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:56,559 INFO L290 TraceCheckUtils]: 112: Hoare triple {113939#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113939#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:56,559 INFO L290 TraceCheckUtils]: 111: Hoare triple {113946#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113939#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:56,559 INFO L290 TraceCheckUtils]: 110: Hoare triple {113946#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113946#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:56,560 INFO L290 TraceCheckUtils]: 109: Hoare triple {113953#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113946#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:56,560 INFO L290 TraceCheckUtils]: 108: Hoare triple {113953#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113953#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:56,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {113960#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113953#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:56,560 INFO L290 TraceCheckUtils]: 106: Hoare triple {113960#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113960#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:56,561 INFO L290 TraceCheckUtils]: 105: Hoare triple {113967#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113960#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:56,561 INFO L290 TraceCheckUtils]: 104: Hoare triple {113967#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113967#(< main_~i~0 1006)} is VALID [2022-04-15 06:06:56,562 INFO L290 TraceCheckUtils]: 103: Hoare triple {113974#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113967#(< main_~i~0 1006)} is VALID [2022-04-15 06:06:56,562 INFO L290 TraceCheckUtils]: 102: Hoare triple {113974#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113974#(< main_~i~0 1005)} is VALID [2022-04-15 06:06:56,562 INFO L290 TraceCheckUtils]: 101: Hoare triple {113981#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113974#(< main_~i~0 1005)} is VALID [2022-04-15 06:06:56,562 INFO L290 TraceCheckUtils]: 100: Hoare triple {113981#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113981#(< main_~i~0 1004)} is VALID [2022-04-15 06:06:56,563 INFO L290 TraceCheckUtils]: 99: Hoare triple {113988#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113981#(< main_~i~0 1004)} is VALID [2022-04-15 06:06:56,563 INFO L290 TraceCheckUtils]: 98: Hoare triple {113988#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113988#(< main_~i~0 1003)} is VALID [2022-04-15 06:06:56,563 INFO L290 TraceCheckUtils]: 97: Hoare triple {113995#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113988#(< main_~i~0 1003)} is VALID [2022-04-15 06:06:56,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {113995#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {113995#(< main_~i~0 1002)} is VALID [2022-04-15 06:06:56,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {114002#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {113995#(< main_~i~0 1002)} is VALID [2022-04-15 06:06:56,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {114002#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114002#(< main_~i~0 1001)} is VALID [2022-04-15 06:06:56,565 INFO L290 TraceCheckUtils]: 93: Hoare triple {114009#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114002#(< main_~i~0 1001)} is VALID [2022-04-15 06:06:56,565 INFO L290 TraceCheckUtils]: 92: Hoare triple {114009#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114009#(< main_~i~0 1000)} is VALID [2022-04-15 06:06:56,565 INFO L290 TraceCheckUtils]: 91: Hoare triple {114016#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114009#(< main_~i~0 1000)} is VALID [2022-04-15 06:06:56,566 INFO L290 TraceCheckUtils]: 90: Hoare triple {114016#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114016#(< main_~i~0 999)} is VALID [2022-04-15 06:06:56,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {114023#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114016#(< main_~i~0 999)} is VALID [2022-04-15 06:06:56,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {114023#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114023#(< main_~i~0 998)} is VALID [2022-04-15 06:06:56,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {114030#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114023#(< main_~i~0 998)} is VALID [2022-04-15 06:06:56,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {114030#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114030#(< main_~i~0 997)} is VALID [2022-04-15 06:06:56,567 INFO L290 TraceCheckUtils]: 85: Hoare triple {114037#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114030#(< main_~i~0 997)} is VALID [2022-04-15 06:06:56,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {114037#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114037#(< main_~i~0 996)} is VALID [2022-04-15 06:06:56,568 INFO L290 TraceCheckUtils]: 83: Hoare triple {114044#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114037#(< main_~i~0 996)} is VALID [2022-04-15 06:06:56,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {114044#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114044#(< main_~i~0 995)} is VALID [2022-04-15 06:06:56,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {114051#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114044#(< main_~i~0 995)} is VALID [2022-04-15 06:06:56,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {114051#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114051#(< main_~i~0 994)} is VALID [2022-04-15 06:06:56,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {114058#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114051#(< main_~i~0 994)} is VALID [2022-04-15 06:06:56,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {114058#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114058#(< main_~i~0 993)} is VALID [2022-04-15 06:06:56,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {114065#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114058#(< main_~i~0 993)} is VALID [2022-04-15 06:06:56,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {114065#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114065#(< main_~i~0 992)} is VALID [2022-04-15 06:06:56,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {114072#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114065#(< main_~i~0 992)} is VALID [2022-04-15 06:06:56,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {114072#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114072#(< main_~i~0 991)} is VALID [2022-04-15 06:06:56,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {114079#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114072#(< main_~i~0 991)} is VALID [2022-04-15 06:06:56,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {114079#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114079#(< main_~i~0 990)} is VALID [2022-04-15 06:06:56,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {114086#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114079#(< main_~i~0 990)} is VALID [2022-04-15 06:06:56,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {114086#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114086#(< main_~i~0 989)} is VALID [2022-04-15 06:06:56,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {114093#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114086#(< main_~i~0 989)} is VALID [2022-04-15 06:06:56,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {114093#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114093#(< main_~i~0 988)} is VALID [2022-04-15 06:06:56,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {114100#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114093#(< main_~i~0 988)} is VALID [2022-04-15 06:06:56,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {114100#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114100#(< main_~i~0 987)} is VALID [2022-04-15 06:06:56,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {114107#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114100#(< main_~i~0 987)} is VALID [2022-04-15 06:06:56,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {114107#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114107#(< main_~i~0 986)} is VALID [2022-04-15 06:06:56,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {114114#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114107#(< main_~i~0 986)} is VALID [2022-04-15 06:06:56,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {114114#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114114#(< main_~i~0 985)} is VALID [2022-04-15 06:06:56,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {114121#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114114#(< main_~i~0 985)} is VALID [2022-04-15 06:06:56,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {114121#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114121#(< main_~i~0 984)} is VALID [2022-04-15 06:06:56,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {114128#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114121#(< main_~i~0 984)} is VALID [2022-04-15 06:06:56,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {114128#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114128#(< main_~i~0 983)} is VALID [2022-04-15 06:06:56,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {114135#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114128#(< main_~i~0 983)} is VALID [2022-04-15 06:06:56,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {114135#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114135#(< main_~i~0 982)} is VALID [2022-04-15 06:06:56,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {114142#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114135#(< main_~i~0 982)} is VALID [2022-04-15 06:06:56,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {114142#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114142#(< main_~i~0 981)} is VALID [2022-04-15 06:06:56,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {114149#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114142#(< main_~i~0 981)} is VALID [2022-04-15 06:06:56,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {114149#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114149#(< main_~i~0 980)} is VALID [2022-04-15 06:06:56,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {114156#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114149#(< main_~i~0 980)} is VALID [2022-04-15 06:06:56,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {114156#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114156#(< main_~i~0 979)} is VALID [2022-04-15 06:06:56,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {114163#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114156#(< main_~i~0 979)} is VALID [2022-04-15 06:06:56,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {114163#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114163#(< main_~i~0 978)} is VALID [2022-04-15 06:06:56,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {114170#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114163#(< main_~i~0 978)} is VALID [2022-04-15 06:06:56,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {114170#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114170#(< main_~i~0 977)} is VALID [2022-04-15 06:06:56,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {114177#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114170#(< main_~i~0 977)} is VALID [2022-04-15 06:06:56,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {114177#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114177#(< main_~i~0 976)} is VALID [2022-04-15 06:06:56,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {114184#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114177#(< main_~i~0 976)} is VALID [2022-04-15 06:06:56,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {114184#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114184#(< main_~i~0 975)} is VALID [2022-04-15 06:06:56,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {114191#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114184#(< main_~i~0 975)} is VALID [2022-04-15 06:06:56,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {114191#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114191#(< main_~i~0 974)} is VALID [2022-04-15 06:06:56,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {114198#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114191#(< main_~i~0 974)} is VALID [2022-04-15 06:06:56,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {114198#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114198#(< main_~i~0 973)} is VALID [2022-04-15 06:06:56,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {114205#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114198#(< main_~i~0 973)} is VALID [2022-04-15 06:06:56,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {114205#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114205#(< main_~i~0 972)} is VALID [2022-04-15 06:06:56,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {114212#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114205#(< main_~i~0 972)} is VALID [2022-04-15 06:06:56,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {114212#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114212#(< main_~i~0 971)} is VALID [2022-04-15 06:06:56,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {114219#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114212#(< main_~i~0 971)} is VALID [2022-04-15 06:06:56,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {114219#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114219#(< main_~i~0 970)} is VALID [2022-04-15 06:06:56,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {114226#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114219#(< main_~i~0 970)} is VALID [2022-04-15 06:06:56,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {114226#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114226#(< main_~i~0 969)} is VALID [2022-04-15 06:06:56,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {114233#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114226#(< main_~i~0 969)} is VALID [2022-04-15 06:06:56,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {114233#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114233#(< main_~i~0 968)} is VALID [2022-04-15 06:06:56,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {114240#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114233#(< main_~i~0 968)} is VALID [2022-04-15 06:06:56,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {114240#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114240#(< main_~i~0 967)} is VALID [2022-04-15 06:06:56,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {114247#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114240#(< main_~i~0 967)} is VALID [2022-04-15 06:06:56,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {114247#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114247#(< main_~i~0 966)} is VALID [2022-04-15 06:06:56,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {114254#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114247#(< main_~i~0 966)} is VALID [2022-04-15 06:06:56,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {114254#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114254#(< main_~i~0 965)} is VALID [2022-04-15 06:06:56,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {114261#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114254#(< main_~i~0 965)} is VALID [2022-04-15 06:06:56,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {114261#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -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 964)} is VALID [2022-04-15 06:06:56,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {114268#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(< main_~i~0 964)} is VALID [2022-04-15 06:06:56,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {114268#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -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 963)} is VALID [2022-04-15 06:06:56,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {114275#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(< main_~i~0 963)} is VALID [2022-04-15 06:06:56,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {114275#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -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 962)} is VALID [2022-04-15 06:06:56,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {114282#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(< main_~i~0 962)} is VALID [2022-04-15 06:06:56,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {114282#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -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 961)} is VALID [2022-04-15 06:06:56,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {114289#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(< main_~i~0 961)} is VALID [2022-04-15 06:06:56,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {114289#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -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 960)} is VALID [2022-04-15 06:06:56,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {114296#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(< main_~i~0 960)} is VALID [2022-04-15 06:06:56,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {114296#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -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 959)} is VALID [2022-04-15 06:06:56,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {114303#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(< main_~i~0 959)} is VALID [2022-04-15 06:06:56,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {114303#(< main_~i~0 958)} assume !!(~i~0 < 1023);assume -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 958)} is VALID [2022-04-15 06:06:56,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {114310#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(< main_~i~0 958)} is VALID [2022-04-15 06:06:56,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {114310#(< main_~i~0 957)} assume !!(~i~0 < 1023);assume -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 957)} is VALID [2022-04-15 06:06:56,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {113282#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114310#(< main_~i~0 957)} is VALID [2022-04-15 06:06:56,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {113282#true} call #t~ret5 := main(); {113282#true} is VALID [2022-04-15 06:06:56,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113282#true} {113282#true} #58#return; {113282#true} is VALID [2022-04-15 06:06:56,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {113282#true} assume true; {113282#true} is VALID [2022-04-15 06:06:56,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {113282#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(10, 2); {113282#true} is VALID [2022-04-15 06:06:56,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {113282#true} call ULTIMATE.init(); {113282#true} is VALID [2022-04-15 06:06:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4363 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:06:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647656897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:56,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:56,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-15 06:06:56,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:56,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422693643] [2022-04-15 06:06:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422693643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:56,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:56,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 06:06:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591179715] [2022-04-15 06:06:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 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 152 [2022-04-15 06:06:56,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:56,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:56,689 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:06:56,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 06:06:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 06:06:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2022-04-15 06:06:56,691 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have 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:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:14,294 INFO L93 Difference]: Finished difference Result 431 states and 498 transitions. [2022-04-15 06:07:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-15 06:07:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 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 152 [2022-04-15 06:07:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have 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:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 493 transitions. [2022-04-15 06:07:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have 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:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 493 transitions. [2022-04-15 06:07:14,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 493 transitions. [2022-04-15 06:07:14,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:14,662 INFO L225 Difference]: With dead ends: 431 [2022-04-15 06:07:14,662 INFO L226 Difference]: Without dead ends: 417 [2022-04-15 06:07:14,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=18498, Invalid=23322, Unknown=0, NotChecked=0, Total=41820 [2022-04-15 06:07:14,665 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1039 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:14,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1039 Valid, 56 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:07:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-15 06:07:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 155. [2022-04-15 06:07:15,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:15,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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:15,864 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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:15,864 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:15,870 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2022-04-15 06:07:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 483 transitions. [2022-04-15 06:07:15,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:15,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:15,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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 417 states. [2022-04-15 06:07:15,871 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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 417 states. [2022-04-15 06:07:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:15,877 INFO L93 Difference]: Finished difference Result 417 states and 483 transitions. [2022-04-15 06:07:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 483 transitions. [2022-04-15 06:07:15,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:15,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:15,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:15,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 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:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2022-04-15 06:07:15,879 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2022-04-15 06:07:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:15,879 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2022-04-15 06:07:15,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.057142857142857) internal successors, (144), 69 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have 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:15,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 156 transitions. [2022-04-15 06:07:16,275 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:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2022-04-15 06:07:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 06:07:16,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:16,276 INFO L499 BasicCegarLoop]: trace histogram [67, 67, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:16,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-15 06:07:16,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-15 06:07:16,477 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1196716651, now seen corresponding path program 135 times [2022-04-15 06:07:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:16,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996588159] [2022-04-15 06:07:16,481 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:16,481 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:16,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1196716651, now seen corresponding path program 136 times [2022-04-15 06:07:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733601291] [2022-04-15 06:07:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:18,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {116547#(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(10, 2); {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:18,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {116547#(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(10, 2); {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 06:07:18,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 06:07:18,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {116479#(= main_~i~0 0)} is VALID [2022-04-15 06:07:18,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {116479#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116479#(= main_~i~0 0)} is VALID [2022-04-15 06:07:18,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {116479#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:18,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {116480#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:18,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {116480#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:18,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {116481#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:18,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {116481#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:18,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {116482#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:18,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {116482#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:18,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {116483#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:18,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {116483#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:18,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {116484#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:18,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {116484#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:18,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {116485#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:18,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {116485#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:18,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {116486#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:18,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {116486#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:18,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {116487#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:18,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {116487#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:18,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {116488#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:18,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {116488#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:18,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {116489#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:18,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {116489#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:18,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {116490#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:18,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {116490#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:18,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {116491#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:18,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {116491#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:18,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {116492#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:18,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {116492#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:18,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {116493#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:18,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {116493#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:18,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {116494#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:18,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {116494#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:18,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:18,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:18,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {116496#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:18,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {116496#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:18,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {116497#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:18,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {116497#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:18,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {116498#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:18,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {116498#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:18,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {116499#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:18,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {116499#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:18,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {116500#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:18,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {116500#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:18,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {116501#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:18,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {116501#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:18,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {116502#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:18,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {116502#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:18,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {116503#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:18,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {116503#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:18,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {116504#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:18,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {116504#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:18,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {116505#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:18,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {116505#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:18,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {116506#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:18,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {116506#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:18,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {116507#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:18,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {116507#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:18,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {116508#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:18,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {116508#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:18,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {116509#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:18,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {116509#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:18,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {116510#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:18,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {116510#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:18,159 INFO L290 TraceCheckUtils]: 70: Hoare triple {116511#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:18,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {116511#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:18,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {116512#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:18,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {116512#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:18,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {116513#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:18,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {116513#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:18,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {116514#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:18,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {116514#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:18,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {116515#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:18,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {116515#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:18,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {116516#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:18,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {116516#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:18,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {116517#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:18,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {116517#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:18,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {116518#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:18,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {116518#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:18,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {116519#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:18,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {116519#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:18,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {116520#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:18,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {116520#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:18,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {116521#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:18,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {116521#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:18,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {116522#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:18,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {116522#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:18,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {116523#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:18,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {116523#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:18,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {116524#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:18,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {116524#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:18,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {116525#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:18,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {116525#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:18,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {116526#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:18,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {116526#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:18,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {116527#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:18,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {116527#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:18,171 INFO L290 TraceCheckUtils]: 104: Hoare triple {116528#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:18,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {116528#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:18,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {116529#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:18,172 INFO L290 TraceCheckUtils]: 107: Hoare triple {116529#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:18,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {116530#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:18,172 INFO L290 TraceCheckUtils]: 109: Hoare triple {116530#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:18,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {116531#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:18,173 INFO L290 TraceCheckUtils]: 111: Hoare triple {116531#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:18,173 INFO L290 TraceCheckUtils]: 112: Hoare triple {116532#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:18,174 INFO L290 TraceCheckUtils]: 113: Hoare triple {116532#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:18,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {116533#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:18,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {116533#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:18,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {116534#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:18,175 INFO L290 TraceCheckUtils]: 117: Hoare triple {116534#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:18,175 INFO L290 TraceCheckUtils]: 118: Hoare triple {116535#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:18,176 INFO L290 TraceCheckUtils]: 119: Hoare triple {116535#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:18,176 INFO L290 TraceCheckUtils]: 120: Hoare triple {116536#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:18,176 INFO L290 TraceCheckUtils]: 121: Hoare triple {116536#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:18,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {116537#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:18,177 INFO L290 TraceCheckUtils]: 123: Hoare triple {116537#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:18,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {116538#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:18,178 INFO L290 TraceCheckUtils]: 125: Hoare triple {116538#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:18,178 INFO L290 TraceCheckUtils]: 126: Hoare triple {116539#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:18,178 INFO L290 TraceCheckUtils]: 127: Hoare triple {116539#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:18,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {116540#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:18,179 INFO L290 TraceCheckUtils]: 129: Hoare triple {116540#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:18,179 INFO L290 TraceCheckUtils]: 130: Hoare triple {116541#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:18,179 INFO L290 TraceCheckUtils]: 131: Hoare triple {116541#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:18,180 INFO L290 TraceCheckUtils]: 132: Hoare triple {116542#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:18,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {116542#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:18,180 INFO L290 TraceCheckUtils]: 134: Hoare triple {116543#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:18,181 INFO L290 TraceCheckUtils]: 135: Hoare triple {116543#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:18,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {116544#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:18,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {116544#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:18,182 INFO L290 TraceCheckUtils]: 138: Hoare triple {116545#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:18,182 INFO L290 TraceCheckUtils]: 139: Hoare triple {116545#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116546#(<= main_~i~0 67)} is VALID [2022-04-15 06:07:18,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {116546#(<= main_~i~0 67)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 06:07:18,183 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 06:07:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:07:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733601291] [2022-04-15 06:07:18,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733601291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423666063] [2022-04-15 06:07:18,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:18,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:18,185 INFO L229 MonitoredProcess]: Starting monitored process 70 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:18,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-15 06:07:18,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:18,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:18,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 06:07:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:19,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116474#true} is VALID [2022-04-15 06:07:19,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#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(10, 2); {116474#true} is VALID [2022-04-15 06:07:19,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 06:07:19,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 06:07:19,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 06:07:19,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {116566#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:19,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {116566#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116566#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:19,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {116566#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:19,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {116480#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116480#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:19,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {116480#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:19,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {116481#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116481#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:19,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {116481#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:19,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {116482#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116482#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:19,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {116482#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:19,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {116483#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116483#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:19,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {116483#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:19,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {116484#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116484#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:19,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {116484#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:19,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {116485#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116485#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:19,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {116485#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:19,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {116486#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116486#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:19,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {116486#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:19,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {116487#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116487#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:19,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {116487#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:19,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {116488#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116488#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:19,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {116488#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:19,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {116489#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116489#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:19,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {116489#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:19,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {116490#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116490#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:19,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {116490#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:19,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {116491#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116491#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:19,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {116491#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:19,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {116492#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116492#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:19,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {116492#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:19,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {116493#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116493#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:19,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {116493#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:19,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {116494#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116494#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:19,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {116494#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:19,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116495#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:19,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:19,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {116496#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116496#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:19,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {116496#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:19,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {116497#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116497#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:19,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {116497#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:19,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {116498#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116498#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:19,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {116498#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:19,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {116499#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116499#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:19,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {116499#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:19,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {116500#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116500#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:19,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {116500#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:19,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {116501#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116501#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:19,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {116501#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:19,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {116502#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116502#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:19,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {116502#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:19,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {116503#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116503#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:19,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {116503#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:19,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {116504#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116504#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:19,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {116504#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:19,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {116505#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116505#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:19,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {116505#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:19,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {116506#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116506#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:19,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {116506#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:19,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {116507#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116507#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:19,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {116507#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:19,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {116508#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116508#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:19,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {116508#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:19,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {116509#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116509#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:19,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {116509#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:19,645 INFO L290 TraceCheckUtils]: 68: Hoare triple {116510#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116510#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:19,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {116510#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:19,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {116511#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116511#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:19,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {116511#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:19,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {116512#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116512#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:19,647 INFO L290 TraceCheckUtils]: 73: Hoare triple {116512#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:19,647 INFO L290 TraceCheckUtils]: 74: Hoare triple {116513#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116513#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:19,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {116513#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:19,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {116514#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116514#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:19,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {116514#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:19,649 INFO L290 TraceCheckUtils]: 78: Hoare triple {116515#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116515#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:19,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {116515#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:19,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {116516#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116516#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:19,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {116516#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:19,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {116517#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116517#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:19,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {116517#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:19,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {116518#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116518#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:19,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {116518#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:19,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {116519#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116519#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:19,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {116519#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:19,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {116520#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116520#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:19,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {116520#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:19,653 INFO L290 TraceCheckUtils]: 90: Hoare triple {116521#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116521#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:19,653 INFO L290 TraceCheckUtils]: 91: Hoare triple {116521#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:19,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {116522#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116522#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:19,654 INFO L290 TraceCheckUtils]: 93: Hoare triple {116522#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:19,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {116523#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116523#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:19,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {116523#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:19,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {116524#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116524#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:19,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {116524#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:19,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {116525#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116525#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:19,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {116525#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:19,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {116526#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116526#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:19,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {116526#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:19,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {116527#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116527#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:19,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {116527#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:19,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {116528#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116528#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:19,658 INFO L290 TraceCheckUtils]: 105: Hoare triple {116528#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:19,658 INFO L290 TraceCheckUtils]: 106: Hoare triple {116529#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116529#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:19,658 INFO L290 TraceCheckUtils]: 107: Hoare triple {116529#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:19,658 INFO L290 TraceCheckUtils]: 108: Hoare triple {116530#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116530#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:19,659 INFO L290 TraceCheckUtils]: 109: Hoare triple {116530#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:19,659 INFO L290 TraceCheckUtils]: 110: Hoare triple {116531#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116531#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:19,659 INFO L290 TraceCheckUtils]: 111: Hoare triple {116531#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:19,660 INFO L290 TraceCheckUtils]: 112: Hoare triple {116532#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116532#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:19,660 INFO L290 TraceCheckUtils]: 113: Hoare triple {116532#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:19,660 INFO L290 TraceCheckUtils]: 114: Hoare triple {116533#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116533#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:19,661 INFO L290 TraceCheckUtils]: 115: Hoare triple {116533#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:19,661 INFO L290 TraceCheckUtils]: 116: Hoare triple {116534#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116534#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:19,661 INFO L290 TraceCheckUtils]: 117: Hoare triple {116534#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:19,662 INFO L290 TraceCheckUtils]: 118: Hoare triple {116535#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116535#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:19,662 INFO L290 TraceCheckUtils]: 119: Hoare triple {116535#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:19,662 INFO L290 TraceCheckUtils]: 120: Hoare triple {116536#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116536#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:19,663 INFO L290 TraceCheckUtils]: 121: Hoare triple {116536#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:19,663 INFO L290 TraceCheckUtils]: 122: Hoare triple {116537#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116537#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:19,663 INFO L290 TraceCheckUtils]: 123: Hoare triple {116537#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:19,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {116538#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116538#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:19,664 INFO L290 TraceCheckUtils]: 125: Hoare triple {116538#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:19,664 INFO L290 TraceCheckUtils]: 126: Hoare triple {116539#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116539#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:19,665 INFO L290 TraceCheckUtils]: 127: Hoare triple {116539#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:19,665 INFO L290 TraceCheckUtils]: 128: Hoare triple {116540#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116540#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:19,665 INFO L290 TraceCheckUtils]: 129: Hoare triple {116540#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:19,666 INFO L290 TraceCheckUtils]: 130: Hoare triple {116541#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116541#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:19,666 INFO L290 TraceCheckUtils]: 131: Hoare triple {116541#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:19,666 INFO L290 TraceCheckUtils]: 132: Hoare triple {116542#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116542#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:19,667 INFO L290 TraceCheckUtils]: 133: Hoare triple {116542#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:19,667 INFO L290 TraceCheckUtils]: 134: Hoare triple {116543#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116543#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:19,667 INFO L290 TraceCheckUtils]: 135: Hoare triple {116543#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:19,668 INFO L290 TraceCheckUtils]: 136: Hoare triple {116544#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116544#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:19,668 INFO L290 TraceCheckUtils]: 137: Hoare triple {116544#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:19,668 INFO L290 TraceCheckUtils]: 138: Hoare triple {116545#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {116545#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 139: Hoare triple {116545#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {116546#(<= main_~i~0 67)} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 140: Hoare triple {116546#(<= main_~i~0 67)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:19,669 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 06:07:19,670 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 06:07:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:07:19,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:24,761 INFO L290 TraceCheckUtils]: 153: Hoare triple {116475#false} assume !false; {116475#false} is VALID [2022-04-15 06:07:24,761 INFO L290 TraceCheckUtils]: 152: Hoare triple {116475#false} assume 0 == ~cond; {116475#false} is VALID [2022-04-15 06:07:24,761 INFO L290 TraceCheckUtils]: 151: Hoare triple {116475#false} ~cond := #in~cond; {116475#false} is VALID [2022-04-15 06:07:24,761 INFO L272 TraceCheckUtils]: 150: Hoare triple {116475#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {116475#false} is VALID [2022-04-15 06:07:24,761 INFO L290 TraceCheckUtils]: 149: Hoare triple {116475#false} assume !(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 148: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 147: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 146: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 145: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 144: Hoare triple {116475#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 143: Hoare triple {116475#false} assume !!(0 != #t~mem4);havoc #t~mem4; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 142: Hoare triple {116475#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 141: Hoare triple {116475#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {116475#false} is VALID [2022-04-15 06:07:24,762 INFO L290 TraceCheckUtils]: 140: Hoare triple {117050#(< main_~i~0 1023)} assume !(~i~0 < 1023); {116475#false} is VALID [2022-04-15 06:07:24,763 INFO L290 TraceCheckUtils]: 139: Hoare triple {117054#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117050#(< main_~i~0 1023)} is VALID [2022-04-15 06:07:24,763 INFO L290 TraceCheckUtils]: 138: Hoare triple {117054#(< main_~i~0 1022)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117054#(< main_~i~0 1022)} is VALID [2022-04-15 06:07:24,763 INFO L290 TraceCheckUtils]: 137: Hoare triple {117061#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117054#(< main_~i~0 1022)} is VALID [2022-04-15 06:07:24,764 INFO L290 TraceCheckUtils]: 136: Hoare triple {117061#(< main_~i~0 1021)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117061#(< main_~i~0 1021)} is VALID [2022-04-15 06:07:24,764 INFO L290 TraceCheckUtils]: 135: Hoare triple {117068#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117061#(< main_~i~0 1021)} is VALID [2022-04-15 06:07:24,764 INFO L290 TraceCheckUtils]: 134: Hoare triple {117068#(< main_~i~0 1020)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117068#(< main_~i~0 1020)} is VALID [2022-04-15 06:07:24,765 INFO L290 TraceCheckUtils]: 133: Hoare triple {117075#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117068#(< main_~i~0 1020)} is VALID [2022-04-15 06:07:24,765 INFO L290 TraceCheckUtils]: 132: Hoare triple {117075#(< main_~i~0 1019)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117075#(< main_~i~0 1019)} is VALID [2022-04-15 06:07:24,765 INFO L290 TraceCheckUtils]: 131: Hoare triple {117082#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117075#(< main_~i~0 1019)} is VALID [2022-04-15 06:07:24,766 INFO L290 TraceCheckUtils]: 130: Hoare triple {117082#(< main_~i~0 1018)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117082#(< main_~i~0 1018)} is VALID [2022-04-15 06:07:24,766 INFO L290 TraceCheckUtils]: 129: Hoare triple {117089#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117082#(< main_~i~0 1018)} is VALID [2022-04-15 06:07:24,766 INFO L290 TraceCheckUtils]: 128: Hoare triple {117089#(< main_~i~0 1017)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117089#(< main_~i~0 1017)} is VALID [2022-04-15 06:07:24,767 INFO L290 TraceCheckUtils]: 127: Hoare triple {117096#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117089#(< main_~i~0 1017)} is VALID [2022-04-15 06:07:24,767 INFO L290 TraceCheckUtils]: 126: Hoare triple {117096#(< main_~i~0 1016)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117096#(< main_~i~0 1016)} is VALID [2022-04-15 06:07:24,767 INFO L290 TraceCheckUtils]: 125: Hoare triple {117103#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117096#(< main_~i~0 1016)} is VALID [2022-04-15 06:07:24,768 INFO L290 TraceCheckUtils]: 124: Hoare triple {117103#(< main_~i~0 1015)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117103#(< main_~i~0 1015)} is VALID [2022-04-15 06:07:24,768 INFO L290 TraceCheckUtils]: 123: Hoare triple {117110#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117103#(< main_~i~0 1015)} is VALID [2022-04-15 06:07:24,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {117110#(< main_~i~0 1014)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117110#(< main_~i~0 1014)} is VALID [2022-04-15 06:07:24,769 INFO L290 TraceCheckUtils]: 121: Hoare triple {117117#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117110#(< main_~i~0 1014)} is VALID [2022-04-15 06:07:24,769 INFO L290 TraceCheckUtils]: 120: Hoare triple {117117#(< main_~i~0 1013)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117117#(< main_~i~0 1013)} is VALID [2022-04-15 06:07:24,769 INFO L290 TraceCheckUtils]: 119: Hoare triple {117124#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117117#(< main_~i~0 1013)} is VALID [2022-04-15 06:07:24,770 INFO L290 TraceCheckUtils]: 118: Hoare triple {117124#(< main_~i~0 1012)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117124#(< main_~i~0 1012)} is VALID [2022-04-15 06:07:24,770 INFO L290 TraceCheckUtils]: 117: Hoare triple {117131#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117124#(< main_~i~0 1012)} is VALID [2022-04-15 06:07:24,770 INFO L290 TraceCheckUtils]: 116: Hoare triple {117131#(< main_~i~0 1011)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117131#(< main_~i~0 1011)} is VALID [2022-04-15 06:07:24,771 INFO L290 TraceCheckUtils]: 115: Hoare triple {117138#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117131#(< main_~i~0 1011)} is VALID [2022-04-15 06:07:24,771 INFO L290 TraceCheckUtils]: 114: Hoare triple {117138#(< main_~i~0 1010)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117138#(< main_~i~0 1010)} is VALID [2022-04-15 06:07:24,771 INFO L290 TraceCheckUtils]: 113: Hoare triple {117145#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117138#(< main_~i~0 1010)} is VALID [2022-04-15 06:07:24,772 INFO L290 TraceCheckUtils]: 112: Hoare triple {117145#(< main_~i~0 1009)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117145#(< main_~i~0 1009)} is VALID [2022-04-15 06:07:24,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {117152#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117145#(< main_~i~0 1009)} is VALID [2022-04-15 06:07:24,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {117152#(< main_~i~0 1008)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117152#(< main_~i~0 1008)} is VALID [2022-04-15 06:07:24,773 INFO L290 TraceCheckUtils]: 109: Hoare triple {117159#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117152#(< main_~i~0 1008)} is VALID [2022-04-15 06:07:24,773 INFO L290 TraceCheckUtils]: 108: Hoare triple {117159#(< main_~i~0 1007)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117159#(< main_~i~0 1007)} is VALID [2022-04-15 06:07:24,773 INFO L290 TraceCheckUtils]: 107: Hoare triple {117166#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117159#(< main_~i~0 1007)} is VALID [2022-04-15 06:07:24,774 INFO L290 TraceCheckUtils]: 106: Hoare triple {117166#(< main_~i~0 1006)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117166#(< main_~i~0 1006)} is VALID [2022-04-15 06:07:24,774 INFO L290 TraceCheckUtils]: 105: Hoare triple {117173#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117166#(< main_~i~0 1006)} is VALID [2022-04-15 06:07:24,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {117173#(< main_~i~0 1005)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117173#(< main_~i~0 1005)} is VALID [2022-04-15 06:07:24,775 INFO L290 TraceCheckUtils]: 103: Hoare triple {117180#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117173#(< main_~i~0 1005)} is VALID [2022-04-15 06:07:24,775 INFO L290 TraceCheckUtils]: 102: Hoare triple {117180#(< main_~i~0 1004)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117180#(< main_~i~0 1004)} is VALID [2022-04-15 06:07:24,775 INFO L290 TraceCheckUtils]: 101: Hoare triple {117187#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117180#(< main_~i~0 1004)} is VALID [2022-04-15 06:07:24,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {117187#(< main_~i~0 1003)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117187#(< main_~i~0 1003)} is VALID [2022-04-15 06:07:24,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {117194#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117187#(< main_~i~0 1003)} is VALID [2022-04-15 06:07:24,776 INFO L290 TraceCheckUtils]: 98: Hoare triple {117194#(< main_~i~0 1002)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117194#(< main_~i~0 1002)} is VALID [2022-04-15 06:07:24,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {117201#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117194#(< main_~i~0 1002)} is VALID [2022-04-15 06:07:24,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {117201#(< main_~i~0 1001)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117201#(< main_~i~0 1001)} is VALID [2022-04-15 06:07:24,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {117208#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117201#(< main_~i~0 1001)} is VALID [2022-04-15 06:07:24,778 INFO L290 TraceCheckUtils]: 94: Hoare triple {117208#(< main_~i~0 1000)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117208#(< main_~i~0 1000)} is VALID [2022-04-15 06:07:24,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {117215#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117208#(< main_~i~0 1000)} is VALID [2022-04-15 06:07:24,778 INFO L290 TraceCheckUtils]: 92: Hoare triple {117215#(< main_~i~0 999)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117215#(< main_~i~0 999)} is VALID [2022-04-15 06:07:24,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {117222#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117215#(< main_~i~0 999)} is VALID [2022-04-15 06:07:24,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {117222#(< main_~i~0 998)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117222#(< main_~i~0 998)} is VALID [2022-04-15 06:07:24,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {117229#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117222#(< main_~i~0 998)} is VALID [2022-04-15 06:07:24,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {117229#(< main_~i~0 997)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117229#(< main_~i~0 997)} is VALID [2022-04-15 06:07:24,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {117236#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117229#(< main_~i~0 997)} is VALID [2022-04-15 06:07:24,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {117236#(< main_~i~0 996)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117236#(< main_~i~0 996)} is VALID [2022-04-15 06:07:24,781 INFO L290 TraceCheckUtils]: 85: Hoare triple {117243#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117236#(< main_~i~0 996)} is VALID [2022-04-15 06:07:24,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {117243#(< main_~i~0 995)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117243#(< main_~i~0 995)} is VALID [2022-04-15 06:07:24,781 INFO L290 TraceCheckUtils]: 83: Hoare triple {117250#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117243#(< main_~i~0 995)} is VALID [2022-04-15 06:07:24,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {117250#(< main_~i~0 994)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117250#(< main_~i~0 994)} is VALID [2022-04-15 06:07:24,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {117257#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117250#(< main_~i~0 994)} is VALID [2022-04-15 06:07:24,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {117257#(< main_~i~0 993)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117257#(< main_~i~0 993)} is VALID [2022-04-15 06:07:24,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {117264#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117257#(< main_~i~0 993)} is VALID [2022-04-15 06:07:24,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {117264#(< main_~i~0 992)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117264#(< main_~i~0 992)} is VALID [2022-04-15 06:07:24,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {117271#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117264#(< main_~i~0 992)} is VALID [2022-04-15 06:07:24,784 INFO L290 TraceCheckUtils]: 76: Hoare triple {117271#(< main_~i~0 991)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117271#(< main_~i~0 991)} is VALID [2022-04-15 06:07:24,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {117278#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117271#(< main_~i~0 991)} is VALID [2022-04-15 06:07:24,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {117278#(< main_~i~0 990)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117278#(< main_~i~0 990)} is VALID [2022-04-15 06:07:24,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {117285#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117278#(< main_~i~0 990)} is VALID [2022-04-15 06:07:24,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {117285#(< main_~i~0 989)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117285#(< main_~i~0 989)} is VALID [2022-04-15 06:07:24,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {117292#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117285#(< main_~i~0 989)} is VALID [2022-04-15 06:07:24,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {117292#(< main_~i~0 988)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117292#(< main_~i~0 988)} is VALID [2022-04-15 06:07:24,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {117299#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117292#(< main_~i~0 988)} is VALID [2022-04-15 06:07:24,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {117299#(< main_~i~0 987)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117299#(< main_~i~0 987)} is VALID [2022-04-15 06:07:24,787 INFO L290 TraceCheckUtils]: 67: Hoare triple {117306#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117299#(< main_~i~0 987)} is VALID [2022-04-15 06:07:24,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {117306#(< main_~i~0 986)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117306#(< main_~i~0 986)} is VALID [2022-04-15 06:07:24,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {117313#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117306#(< main_~i~0 986)} is VALID [2022-04-15 06:07:24,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {117313#(< main_~i~0 985)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117313#(< main_~i~0 985)} is VALID [2022-04-15 06:07:24,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {117320#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117313#(< main_~i~0 985)} is VALID [2022-04-15 06:07:24,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {117320#(< main_~i~0 984)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117320#(< main_~i~0 984)} is VALID [2022-04-15 06:07:24,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {117327#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117320#(< main_~i~0 984)} is VALID [2022-04-15 06:07:24,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {117327#(< main_~i~0 983)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117327#(< main_~i~0 983)} is VALID [2022-04-15 06:07:24,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {117334#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117327#(< main_~i~0 983)} is VALID [2022-04-15 06:07:24,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {117334#(< main_~i~0 982)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117334#(< main_~i~0 982)} is VALID [2022-04-15 06:07:24,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {117341#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117334#(< main_~i~0 982)} is VALID [2022-04-15 06:07:24,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {117341#(< main_~i~0 981)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117341#(< main_~i~0 981)} is VALID [2022-04-15 06:07:24,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {117348#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117341#(< main_~i~0 981)} is VALID [2022-04-15 06:07:24,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {117348#(< main_~i~0 980)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117348#(< main_~i~0 980)} is VALID [2022-04-15 06:07:24,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {117355#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117348#(< main_~i~0 980)} is VALID [2022-04-15 06:07:24,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {117355#(< main_~i~0 979)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117355#(< main_~i~0 979)} is VALID [2022-04-15 06:07:24,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {117362#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117355#(< main_~i~0 979)} is VALID [2022-04-15 06:07:24,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {117362#(< main_~i~0 978)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117362#(< main_~i~0 978)} is VALID [2022-04-15 06:07:24,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {117369#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117362#(< main_~i~0 978)} is VALID [2022-04-15 06:07:24,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {117369#(< main_~i~0 977)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117369#(< main_~i~0 977)} is VALID [2022-04-15 06:07:24,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {117376#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117369#(< main_~i~0 977)} is VALID [2022-04-15 06:07:24,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {117376#(< main_~i~0 976)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117376#(< main_~i~0 976)} is VALID [2022-04-15 06:07:24,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {117383#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117376#(< main_~i~0 976)} is VALID [2022-04-15 06:07:24,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {117383#(< main_~i~0 975)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117383#(< main_~i~0 975)} is VALID [2022-04-15 06:07:24,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {117390#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117383#(< main_~i~0 975)} is VALID [2022-04-15 06:07:24,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {117390#(< main_~i~0 974)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117390#(< main_~i~0 974)} is VALID [2022-04-15 06:07:24,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {117397#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117390#(< main_~i~0 974)} is VALID [2022-04-15 06:07:24,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {117397#(< main_~i~0 973)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117397#(< main_~i~0 973)} is VALID [2022-04-15 06:07:24,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {117404#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117397#(< main_~i~0 973)} is VALID [2022-04-15 06:07:24,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {117404#(< main_~i~0 972)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117404#(< main_~i~0 972)} is VALID [2022-04-15 06:07:24,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {117411#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117404#(< main_~i~0 972)} is VALID [2022-04-15 06:07:24,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {117411#(< main_~i~0 971)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117411#(< main_~i~0 971)} is VALID [2022-04-15 06:07:24,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {117418#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117411#(< main_~i~0 971)} is VALID [2022-04-15 06:07:24,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {117418#(< main_~i~0 970)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117418#(< main_~i~0 970)} is VALID [2022-04-15 06:07:24,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {117425#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117418#(< main_~i~0 970)} is VALID [2022-04-15 06:07:24,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {117425#(< main_~i~0 969)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117425#(< main_~i~0 969)} is VALID [2022-04-15 06:07:24,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {117432#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117425#(< main_~i~0 969)} is VALID [2022-04-15 06:07:24,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {117432#(< main_~i~0 968)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117432#(< main_~i~0 968)} is VALID [2022-04-15 06:07:24,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {117439#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117432#(< main_~i~0 968)} is VALID [2022-04-15 06:07:24,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {117439#(< main_~i~0 967)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117439#(< main_~i~0 967)} is VALID [2022-04-15 06:07:24,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {117446#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117439#(< main_~i~0 967)} is VALID [2022-04-15 06:07:24,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {117446#(< main_~i~0 966)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117446#(< main_~i~0 966)} is VALID [2022-04-15 06:07:24,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {117453#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117446#(< main_~i~0 966)} is VALID [2022-04-15 06:07:24,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {117453#(< main_~i~0 965)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117453#(< main_~i~0 965)} is VALID [2022-04-15 06:07:24,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {117460#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117453#(< main_~i~0 965)} is VALID [2022-04-15 06:07:24,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {117460#(< main_~i~0 964)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117460#(< main_~i~0 964)} is VALID [2022-04-15 06:07:24,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {117467#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117460#(< main_~i~0 964)} is VALID [2022-04-15 06:07:24,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {117467#(< main_~i~0 963)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117467#(< main_~i~0 963)} is VALID [2022-04-15 06:07:24,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {117474#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117467#(< main_~i~0 963)} is VALID [2022-04-15 06:07:24,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {117474#(< main_~i~0 962)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117474#(< main_~i~0 962)} is VALID [2022-04-15 06:07:24,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {117481#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117474#(< main_~i~0 962)} is VALID [2022-04-15 06:07:24,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {117481#(< main_~i~0 961)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117481#(< main_~i~0 961)} is VALID [2022-04-15 06:07:24,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {117488#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117481#(< main_~i~0 961)} is VALID [2022-04-15 06:07:24,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {117488#(< main_~i~0 960)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117488#(< main_~i~0 960)} is VALID [2022-04-15 06:07:24,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {117495#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117488#(< main_~i~0 960)} is VALID [2022-04-15 06:07:24,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {117495#(< main_~i~0 959)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117495#(< main_~i~0 959)} is VALID [2022-04-15 06:07:24,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {117502#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117495#(< main_~i~0 959)} is VALID [2022-04-15 06:07:24,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {117502#(< main_~i~0 958)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117502#(< main_~i~0 958)} is VALID [2022-04-15 06:07:24,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {117509#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117502#(< main_~i~0 958)} is VALID [2022-04-15 06:07:24,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {117509#(< main_~i~0 957)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117509#(< main_~i~0 957)} is VALID [2022-04-15 06:07:24,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {117516#(< main_~i~0 956)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117509#(< main_~i~0 957)} is VALID [2022-04-15 06:07:24,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {117516#(< main_~i~0 956)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117516#(< main_~i~0 956)} is VALID [2022-04-15 06:07:24,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {116474#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117516#(< main_~i~0 956)} is VALID [2022-04-15 06:07:24,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {116474#true} call #t~ret5 := main(); {116474#true} is VALID [2022-04-15 06:07:24,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116474#true} {116474#true} #58#return; {116474#true} is VALID [2022-04-15 06:07:24,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {116474#true} assume true; {116474#true} is VALID [2022-04-15 06:07:24,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {116474#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(10, 2); {116474#true} is VALID [2022-04-15 06:07:24,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {116474#true} call ULTIMATE.init(); {116474#true} is VALID [2022-04-15 06:07:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:07:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423666063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:24,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-15 06:07:24,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:24,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996588159] [2022-04-15 06:07:24,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996588159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:24,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:24,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 06:07:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813867521] [2022-04-15 06:07:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 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 154 [2022-04-15 06:07:24,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:24,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have 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:24,904 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:07:24,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 06:07:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 06:07:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9593, Invalid=9867, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 06:07:24,907 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have 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:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:43,475 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2022-04-15 06:07:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 06:07:43,476 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 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 154 [2022-04-15 06:07:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have 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:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 500 transitions. [2022-04-15 06:07:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have 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:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 500 transitions. [2022-04-15 06:07:43,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 500 transitions. [2022-04-15 06:07:43,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:43,866 INFO L225 Difference]: With dead ends: 437 [2022-04-15 06:07:43,866 INFO L226 Difference]: Without dead ends: 423 [2022-04-15 06:07:43,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=19046, Invalid=24010, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 06:07:43,868 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:43,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 31 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:07:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-15 06:07:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 157. [2022-04-15 06:07:45,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:45,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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:45,119 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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:45,119 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:45,126 INFO L93 Difference]: Finished difference Result 423 states and 490 transitions. [2022-04-15 06:07:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2022-04-15 06:07:45,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:45,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:45,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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 423 states. [2022-04-15 06:07:45,127 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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 423 states. [2022-04-15 06:07:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:45,136 INFO L93 Difference]: Finished difference Result 423 states and 490 transitions. [2022-04-15 06:07:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 490 transitions. [2022-04-15 06:07:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:45,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:45,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 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:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-15 06:07:45,140 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2022-04-15 06:07:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:45,140 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-15 06:07:45,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.056338028169014) internal successors, (146), 70 states have internal predecessors, (146), 2 states have call successors, (3), 3 states have 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:45,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-15 06:07:45,560 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:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-15 06:07:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 06:07:45,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:45,560 INFO L499 BasicCegarLoop]: trace histogram [68, 68, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:45,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:45,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:45,761 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash -755811529, now seen corresponding path program 137 times [2022-04-15 06:07:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:45,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692250524] [2022-04-15 06:07:45,764 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:45,765 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:45,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash -755811529, now seen corresponding path program 138 times [2022-04-15 06:07:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:45,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569915473] [2022-04-15 06:07:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:47,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {119784#(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(10, 2); {119710#true} is VALID [2022-04-15 06:07:47,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 06:07:47,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 06:07:47,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:47,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {119784#(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(10, 2); {119710#true} is VALID [2022-04-15 06:07:47,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 06:07:47,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 06:07:47,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 06:07:47,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119715#(= main_~i~0 0)} is VALID [2022-04-15 06:07:47,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {119715#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119715#(= main_~i~0 0)} is VALID [2022-04-15 06:07:47,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {119715#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:47,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {119716#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:47,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {119716#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:47,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {119717#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:47,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {119717#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119718#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:47,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {119718#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119718#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:47,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {119718#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119719#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:47,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {119719#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119719#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:47,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {119719#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119720#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:47,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {119720#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119720#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:47,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {119720#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119721#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:47,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {119721#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119721#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:47,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {119721#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119722#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:47,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {119722#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119722#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:47,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {119722#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119723#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:47,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {119723#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119723#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:47,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {119723#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119724#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:47,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {119724#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119724#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:47,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {119724#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119725#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:47,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {119725#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119725#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:47,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {119725#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119726#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:47,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {119726#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119726#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:47,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {119726#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119727#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:47,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {119727#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119727#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:47,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {119727#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119728#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:47,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {119728#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119728#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:47,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {119728#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119729#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:47,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {119729#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119729#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:47,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {119729#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119730#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:47,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {119730#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119730#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:47,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {119730#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119731#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:47,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {119731#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119731#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:47,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {119731#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119732#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:47,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {119732#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119732#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:47,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {119732#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119733#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:47,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {119733#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119733#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:47,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {119733#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119734#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:47,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {119734#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119734#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:47,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {119734#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119735#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:47,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {119735#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119735#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:47,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {119735#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119736#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:47,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {119736#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119736#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:47,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {119736#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119737#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:47,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {119737#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119737#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:47,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {119737#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119738#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:47,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {119738#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119738#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:47,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {119738#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119739#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:47,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {119739#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119739#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:47,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {119739#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119740#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:47,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {119740#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119740#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:47,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {119740#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119741#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:47,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {119741#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119741#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:47,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {119741#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119742#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:47,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {119742#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119742#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:47,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {119742#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119743#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:47,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {119743#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119743#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:47,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {119743#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119744#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:47,535 INFO L290 TraceCheckUtils]: 64: Hoare triple {119744#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119744#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:47,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {119744#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119745#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:47,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {119745#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119745#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:47,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {119745#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119746#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:47,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {119746#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119746#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:47,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {119746#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119747#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:47,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {119747#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119747#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:47,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {119747#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119748#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:47,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {119748#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119748#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:47,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {119748#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119749#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:47,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {119749#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119749#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:47,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {119749#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119750#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:47,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {119750#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119750#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:47,539 INFO L290 TraceCheckUtils]: 77: Hoare triple {119750#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119751#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:47,539 INFO L290 TraceCheckUtils]: 78: Hoare triple {119751#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119751#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:47,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {119751#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119752#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:47,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {119752#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119752#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:47,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {119752#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119753#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:47,541 INFO L290 TraceCheckUtils]: 82: Hoare triple {119753#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119753#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:47,541 INFO L290 TraceCheckUtils]: 83: Hoare triple {119753#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119754#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:47,541 INFO L290 TraceCheckUtils]: 84: Hoare triple {119754#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119754#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:47,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {119754#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119755#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:47,542 INFO L290 TraceCheckUtils]: 86: Hoare triple {119755#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119755#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:47,542 INFO L290 TraceCheckUtils]: 87: Hoare triple {119755#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119756#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:47,542 INFO L290 TraceCheckUtils]: 88: Hoare triple {119756#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119756#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:47,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {119756#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119757#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:47,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {119757#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119757#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:47,543 INFO L290 TraceCheckUtils]: 91: Hoare triple {119757#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119758#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:47,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {119758#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119758#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:47,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {119758#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119759#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:47,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {119759#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119759#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:47,545 INFO L290 TraceCheckUtils]: 95: Hoare triple {119759#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119760#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:47,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {119760#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119760#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:47,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {119760#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119761#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:47,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {119761#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119761#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:47,546 INFO L290 TraceCheckUtils]: 99: Hoare triple {119761#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119762#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:47,546 INFO L290 TraceCheckUtils]: 100: Hoare triple {119762#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119762#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:47,547 INFO L290 TraceCheckUtils]: 101: Hoare triple {119762#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119763#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:47,547 INFO L290 TraceCheckUtils]: 102: Hoare triple {119763#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119763#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:47,547 INFO L290 TraceCheckUtils]: 103: Hoare triple {119763#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119764#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:47,548 INFO L290 TraceCheckUtils]: 104: Hoare triple {119764#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119764#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:47,548 INFO L290 TraceCheckUtils]: 105: Hoare triple {119764#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119765#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:47,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {119765#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119765#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:47,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {119765#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119766#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:47,549 INFO L290 TraceCheckUtils]: 108: Hoare triple {119766#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119766#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:47,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {119766#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119767#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:47,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {119767#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119767#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:47,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {119767#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119768#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:47,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {119768#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119768#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:47,551 INFO L290 TraceCheckUtils]: 113: Hoare triple {119768#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119769#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:47,551 INFO L290 TraceCheckUtils]: 114: Hoare triple {119769#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119769#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:47,551 INFO L290 TraceCheckUtils]: 115: Hoare triple {119769#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119770#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:47,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {119770#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119770#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:47,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {119770#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119771#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:47,552 INFO L290 TraceCheckUtils]: 118: Hoare triple {119771#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119771#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:47,553 INFO L290 TraceCheckUtils]: 119: Hoare triple {119771#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119772#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:47,553 INFO L290 TraceCheckUtils]: 120: Hoare triple {119772#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119772#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:47,553 INFO L290 TraceCheckUtils]: 121: Hoare triple {119772#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119773#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:47,554 INFO L290 TraceCheckUtils]: 122: Hoare triple {119773#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119773#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:47,554 INFO L290 TraceCheckUtils]: 123: Hoare triple {119773#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119774#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:47,554 INFO L290 TraceCheckUtils]: 124: Hoare triple {119774#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119774#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:47,555 INFO L290 TraceCheckUtils]: 125: Hoare triple {119774#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119775#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:47,555 INFO L290 TraceCheckUtils]: 126: Hoare triple {119775#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119775#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:47,555 INFO L290 TraceCheckUtils]: 127: Hoare triple {119775#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119776#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:47,555 INFO L290 TraceCheckUtils]: 128: Hoare triple {119776#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119776#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:47,556 INFO L290 TraceCheckUtils]: 129: Hoare triple {119776#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119777#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:47,556 INFO L290 TraceCheckUtils]: 130: Hoare triple {119777#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119777#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:47,557 INFO L290 TraceCheckUtils]: 131: Hoare triple {119777#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119778#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:47,557 INFO L290 TraceCheckUtils]: 132: Hoare triple {119778#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119778#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:47,557 INFO L290 TraceCheckUtils]: 133: Hoare triple {119778#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119779#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:47,557 INFO L290 TraceCheckUtils]: 134: Hoare triple {119779#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119779#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:47,558 INFO L290 TraceCheckUtils]: 135: Hoare triple {119779#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119780#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:47,558 INFO L290 TraceCheckUtils]: 136: Hoare triple {119780#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119780#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:47,558 INFO L290 TraceCheckUtils]: 137: Hoare triple {119780#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119781#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:47,559 INFO L290 TraceCheckUtils]: 138: Hoare triple {119781#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119781#(<= main_~i~0 66)} is VALID [2022-04-15 06:07:47,559 INFO L290 TraceCheckUtils]: 139: Hoare triple {119781#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119782#(<= main_~i~0 67)} is VALID [2022-04-15 06:07:47,559 INFO L290 TraceCheckUtils]: 140: Hoare triple {119782#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119782#(<= main_~i~0 67)} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 141: Hoare triple {119782#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119783#(<= main_~i~0 68)} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 142: Hoare triple {119783#(<= main_~i~0 68)} assume !(~i~0 < 1023); {119711#false} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 143: Hoare triple {119711#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {119711#false} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 144: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 145: Hoare triple {119711#false} assume !!(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 06:07:47,560 INFO L290 TraceCheckUtils]: 146: Hoare triple {119711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 147: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 148: Hoare triple {119711#false} assume !!(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 149: Hoare triple {119711#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 150: Hoare triple {119711#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 151: Hoare triple {119711#false} assume !(0 != #t~mem4);havoc #t~mem4; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L272 TraceCheckUtils]: 152: Hoare triple {119711#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 153: Hoare triple {119711#false} ~cond := #in~cond; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 154: Hoare triple {119711#false} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 06:07:47,561 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 06:07:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:07:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:47,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569915473] [2022-04-15 06:07:47,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569915473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:47,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310228381] [2022-04-15 06:07:47,562 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:47,563 INFO L229 MonitoredProcess]: Starting monitored process 71 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:47,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-15 06:07:48,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:07:48,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:48,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:07:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:48,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:48,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119710#true} is VALID [2022-04-15 06:07:48,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#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(10, 2); {119710#true} is VALID [2022-04-15 06:07:48,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 78: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 79: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 80: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 82: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 84: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 86: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 91: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 92: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 95: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 96: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 97: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 99: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 100: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 101: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 102: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 103: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 104: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 106: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 107: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 108: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 109: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 110: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 111: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 112: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 113: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 114: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 115: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 116: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 117: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 118: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 119: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,431 INFO L290 TraceCheckUtils]: 120: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 121: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 122: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 123: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 124: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 125: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 126: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 127: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 128: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 129: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 130: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 131: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 132: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 133: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 134: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,432 INFO L290 TraceCheckUtils]: 135: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 136: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 137: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 138: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 139: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 140: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 141: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 142: Hoare triple {119710#true} assume !(~i~0 < 1023); {119710#true} is VALID [2022-04-15 06:07:48,433 INFO L290 TraceCheckUtils]: 143: Hoare triple {119710#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {120217#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:48,434 INFO L290 TraceCheckUtils]: 144: Hoare triple {120217#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120217#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:48,434 INFO L290 TraceCheckUtils]: 145: Hoare triple {120217#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {120217#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:48,434 INFO L290 TraceCheckUtils]: 146: Hoare triple {120217#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:48,435 INFO L290 TraceCheckUtils]: 147: Hoare triple {119716#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119716#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:48,435 INFO L290 TraceCheckUtils]: 148: Hoare triple {119716#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {119716#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:48,435 INFO L290 TraceCheckUtils]: 149: Hoare triple {119716#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:48,436 INFO L290 TraceCheckUtils]: 150: Hoare triple {119717#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {119717#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:48,436 INFO L290 TraceCheckUtils]: 151: Hoare triple {119717#(<= main_~i~0 2)} assume !(0 != #t~mem4);havoc #t~mem4; {119717#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:48,436 INFO L272 TraceCheckUtils]: 152: Hoare triple {119717#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:48,437 INFO L290 TraceCheckUtils]: 153: Hoare triple {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {120249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:07:48,437 INFO L290 TraceCheckUtils]: 154: Hoare triple {120249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 06:07:48,437 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 06:07:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 06:07:48,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:48,842 INFO L290 TraceCheckUtils]: 155: Hoare triple {119711#false} assume !false; {119711#false} is VALID [2022-04-15 06:07:48,842 INFO L290 TraceCheckUtils]: 154: Hoare triple {120249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119711#false} is VALID [2022-04-15 06:07:48,843 INFO L290 TraceCheckUtils]: 153: Hoare triple {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {120249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:07:48,843 INFO L272 TraceCheckUtils]: 152: Hoare triple {120265#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {120245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:48,843 INFO L290 TraceCheckUtils]: 151: Hoare triple {120265#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 06:07:48,844 INFO L290 TraceCheckUtils]: 150: Hoare triple {120265#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 06:07:48,844 INFO L290 TraceCheckUtils]: 149: Hoare triple {120275#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {120265#(<= main_~i~0 1024)} is VALID [2022-04-15 06:07:48,844 INFO L290 TraceCheckUtils]: 148: Hoare triple {120275#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 06:07:48,845 INFO L290 TraceCheckUtils]: 147: Hoare triple {120275#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 06:07:48,845 INFO L290 TraceCheckUtils]: 146: Hoare triple {120285#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {120275#(<= main_~i~0 1023)} is VALID [2022-04-15 06:07:48,845 INFO L290 TraceCheckUtils]: 145: Hoare triple {120285#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 144: Hoare triple {120285#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 143: Hoare triple {119710#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {120285#(<= main_~i~0 1022)} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 142: Hoare triple {119710#true} assume !(~i~0 < 1023); {119710#true} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 141: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 140: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 139: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,846 INFO L290 TraceCheckUtils]: 138: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 137: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 136: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 135: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 134: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 133: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 132: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 131: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 130: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 129: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 128: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 127: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 126: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 125: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 124: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,847 INFO L290 TraceCheckUtils]: 123: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 122: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 121: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 120: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 119: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 118: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 117: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 116: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 115: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 114: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 113: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 112: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 111: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 110: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,848 INFO L290 TraceCheckUtils]: 109: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 106: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 105: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 104: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 103: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 102: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 100: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 97: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 96: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 92: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 91: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 90: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 89: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 88: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 87: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 86: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 85: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 82: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 81: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,850 INFO L290 TraceCheckUtils]: 80: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 79: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 78: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 76: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 66: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {119710#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {119710#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {119710#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {119710#true} call #t~ret5 := main(); {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119710#true} {119710#true} #58#return; {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {119710#true} assume true; {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {119710#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(10, 2); {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {119710#true} call ULTIMATE.init(); {119710#true} is VALID [2022-04-15 06:07:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4631 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2022-04-15 06:07:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310228381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:48,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:48,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 7, 7] total 78 [2022-04-15 06:07:48,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692250524] [2022-04-15 06:07:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692250524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:48,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:48,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 06:07:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426070892] [2022-04-15 06:07:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 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 156 [2022-04-15 06:07:48,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:48,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have 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:48,961 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:07:48,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 06:07:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 06:07:48,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2781, Invalid=3225, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 06:07:48,963 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have 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:08:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:08,085 INFO L93 Difference]: Finished difference Result 443 states and 512 transitions. [2022-04-15 06:08:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 06:08:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 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 156 [2022-04-15 06:08:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have 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:08:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 507 transitions. [2022-04-15 06:08:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have 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:08:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 507 transitions. [2022-04-15 06:08:08,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 507 transitions. [2022-04-15 06:08:08,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:08:08,529 INFO L225 Difference]: With dead ends: 443 [2022-04-15 06:08:08,530 INFO L226 Difference]: Without dead ends: 429 [2022-04-15 06:08:08,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7957, Invalid=13505, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 06:08:08,531 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 1145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:08,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1145 Valid, 36 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:08:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-15 06:08:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 159. [2022-04-15 06:08:10,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:10,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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:08:10,394 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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:08:10,394 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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:08:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,409 INFO L93 Difference]: Finished difference Result 429 states and 497 transitions. [2022-04-15 06:08:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 497 transitions. [2022-04-15 06:08:10,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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 429 states. [2022-04-15 06:08:10,411 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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 429 states. [2022-04-15 06:08:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:10,421 INFO L93 Difference]: Finished difference Result 429 states and 497 transitions. [2022-04-15 06:08:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 497 transitions. [2022-04-15 06:08:10,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:10,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:10,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:10,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 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:08:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-15 06:08:10,424 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2022-04-15 06:08:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:10,424 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-15 06:08:10,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 71 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have 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:08:10,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-15 06:08:10,941 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:08:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-15 06:08:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 06:08:10,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:10,942 INFO L499 BasicCegarLoop]: trace histogram [69, 69, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:10,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:11,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:11,158 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2047215705, now seen corresponding path program 139 times [2022-04-15 06:08:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:11,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935504703] [2022-04-15 06:08:11,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:11,162 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:08:11,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:08:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2047215705, now seen corresponding path program 140 times [2022-04-15 06:08:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:11,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344190332] [2022-04-15 06:08:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:12,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {123001#(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(10, 2); {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {122926#true} call ULTIMATE.init(); {123001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:12,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {123001#(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(10, 2); {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 06:08:12,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {122926#true} call #t~ret5 := main(); {122926#true} is VALID [2022-04-15 06:08:12,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {122926#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {122931#(= main_~i~0 0)} is VALID [2022-04-15 06:08:12,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {122931#(= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122931#(= main_~i~0 0)} is VALID [2022-04-15 06:08:12,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {122931#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:12,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {122932#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:12,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {122932#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:12,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {122933#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:12,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {122933#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:12,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {122934#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:12,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {122934#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:12,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {122935#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:12,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {122935#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:12,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {122936#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:12,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {122936#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:12,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {122937#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:12,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {122937#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:12,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {122938#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:12,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {122938#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:12,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {122939#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:12,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {122939#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:12,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {122940#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:12,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {122940#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:12,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {122941#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:12,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {122941#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:12,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {122942#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:12,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {122942#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:12,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {122943#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:12,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {122943#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:12,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {122944#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:12,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {122944#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:12,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {122945#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:12,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {122945#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:12,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {122946#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:12,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {122946#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:12,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {122947#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:12,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {122947#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:12,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {122948#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:12,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {122948#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:12,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {122949#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:12,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {122949#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:12,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {122950#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:12,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {122950#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:12,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {122951#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:12,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {122951#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:12,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {122952#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:12,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {122952#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:12,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {122953#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:12,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {122953#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:12,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {122954#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:12,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {122954#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:12,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {122955#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:12,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {122955#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:12,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {122956#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:12,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {122956#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:12,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {122957#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:12,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {122957#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:12,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {122958#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:12,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {122958#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:12,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {122959#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:12,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {122959#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:12,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {122960#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:12,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {122960#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:12,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {122961#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:12,982 INFO L290 TraceCheckUtils]: 67: Hoare triple {122961#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:12,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {122962#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:12,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {122962#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:12,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {122963#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:12,983 INFO L290 TraceCheckUtils]: 71: Hoare triple {122963#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:12,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {122964#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:12,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {122964#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:12,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {122965#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:12,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {122965#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:12,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {122966#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:12,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {122966#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:12,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {122967#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:12,986 INFO L290 TraceCheckUtils]: 79: Hoare triple {122967#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:12,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {122968#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:12,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {122968#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:12,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {122969#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:12,987 INFO L290 TraceCheckUtils]: 83: Hoare triple {122969#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:12,988 INFO L290 TraceCheckUtils]: 84: Hoare triple {122970#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:12,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {122970#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:12,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {122971#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:12,989 INFO L290 TraceCheckUtils]: 87: Hoare triple {122971#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:12,989 INFO L290 TraceCheckUtils]: 88: Hoare triple {122972#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:12,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {122972#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:12,990 INFO L290 TraceCheckUtils]: 90: Hoare triple {122973#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:12,990 INFO L290 TraceCheckUtils]: 91: Hoare triple {122973#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:12,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {122974#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:12,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {122974#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:12,991 INFO L290 TraceCheckUtils]: 94: Hoare triple {122975#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:12,991 INFO L290 TraceCheckUtils]: 95: Hoare triple {122975#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:12,991 INFO L290 TraceCheckUtils]: 96: Hoare triple {122976#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:12,992 INFO L290 TraceCheckUtils]: 97: Hoare triple {122976#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:12,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {122977#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:12,993 INFO L290 TraceCheckUtils]: 99: Hoare triple {122977#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:12,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {122978#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:12,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {122978#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:12,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {122979#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:12,994 INFO L290 TraceCheckUtils]: 103: Hoare triple {122979#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:12,994 INFO L290 TraceCheckUtils]: 104: Hoare triple {122980#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:12,994 INFO L290 TraceCheckUtils]: 105: Hoare triple {122980#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:12,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {122981#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:12,995 INFO L290 TraceCheckUtils]: 107: Hoare triple {122981#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:12,995 INFO L290 TraceCheckUtils]: 108: Hoare triple {122982#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:12,996 INFO L290 TraceCheckUtils]: 109: Hoare triple {122982#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:12,996 INFO L290 TraceCheckUtils]: 110: Hoare triple {122983#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:12,996 INFO L290 TraceCheckUtils]: 111: Hoare triple {122983#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:12,997 INFO L290 TraceCheckUtils]: 112: Hoare triple {122984#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:12,997 INFO L290 TraceCheckUtils]: 113: Hoare triple {122984#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:12,997 INFO L290 TraceCheckUtils]: 114: Hoare triple {122985#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:12,998 INFO L290 TraceCheckUtils]: 115: Hoare triple {122985#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:12,998 INFO L290 TraceCheckUtils]: 116: Hoare triple {122986#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:12,998 INFO L290 TraceCheckUtils]: 117: Hoare triple {122986#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:12,999 INFO L290 TraceCheckUtils]: 118: Hoare triple {122987#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:12,999 INFO L290 TraceCheckUtils]: 119: Hoare triple {122987#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:12,999 INFO L290 TraceCheckUtils]: 120: Hoare triple {122988#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:13,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {122988#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:13,000 INFO L290 TraceCheckUtils]: 122: Hoare triple {122989#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:13,000 INFO L290 TraceCheckUtils]: 123: Hoare triple {122989#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:13,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {122990#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:13,001 INFO L290 TraceCheckUtils]: 125: Hoare triple {122990#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:13,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {122991#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:13,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {122991#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:13,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {122992#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:13,002 INFO L290 TraceCheckUtils]: 129: Hoare triple {122992#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:13,003 INFO L290 TraceCheckUtils]: 130: Hoare triple {122993#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:13,003 INFO L290 TraceCheckUtils]: 131: Hoare triple {122993#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:13,003 INFO L290 TraceCheckUtils]: 132: Hoare triple {122994#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:13,004 INFO L290 TraceCheckUtils]: 133: Hoare triple {122994#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:13,004 INFO L290 TraceCheckUtils]: 134: Hoare triple {122995#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:13,004 INFO L290 TraceCheckUtils]: 135: Hoare triple {122995#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:13,005 INFO L290 TraceCheckUtils]: 136: Hoare triple {122996#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:13,005 INFO L290 TraceCheckUtils]: 137: Hoare triple {122996#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:13,005 INFO L290 TraceCheckUtils]: 138: Hoare triple {122997#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:13,006 INFO L290 TraceCheckUtils]: 139: Hoare triple {122997#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 06:08:13,006 INFO L290 TraceCheckUtils]: 140: Hoare triple {122998#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 06:08:13,006 INFO L290 TraceCheckUtils]: 141: Hoare triple {122998#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 06:08:13,006 INFO L290 TraceCheckUtils]: 142: Hoare triple {122999#(<= main_~i~0 68)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 06:08:13,007 INFO L290 TraceCheckUtils]: 143: Hoare triple {122999#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123000#(<= main_~i~0 69)} is VALID [2022-04-15 06:08:13,007 INFO L290 TraceCheckUtils]: 144: Hoare triple {123000#(<= main_~i~0 69)} assume !(~i~0 < 1023); {122927#false} is VALID [2022-04-15 06:08:13,007 INFO L290 TraceCheckUtils]: 145: Hoare triple {122927#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {122927#false} is VALID [2022-04-15 06:08:13,007 INFO L290 TraceCheckUtils]: 146: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:13,007 INFO L290 TraceCheckUtils]: 147: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 148: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 149: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 150: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 151: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 152: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 153: Hoare triple {122927#false} assume !(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L272 TraceCheckUtils]: 154: Hoare triple {122927#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 155: Hoare triple {122927#false} ~cond := #in~cond; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 156: Hoare triple {122927#false} assume 0 == ~cond; {122927#false} is VALID [2022-04-15 06:08:13,008 INFO L290 TraceCheckUtils]: 157: Hoare triple {122927#false} assume !false; {122927#false} is VALID [2022-04-15 06:08:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4768 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:08:13,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:13,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344190332] [2022-04-15 06:08:13,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344190332] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:13,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009196548] [2022-04-15 06:08:13,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:08:13,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:13,010 INFO L229 MonitoredProcess]: Starting monitored process 72 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:13,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-15 06:08:13,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:08:13,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:13,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 06:08:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:13,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:14,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {122926#true} call ULTIMATE.init(); {122926#true} is VALID [2022-04-15 06:08:14,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {122926#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(10, 2); {122926#true} is VALID [2022-04-15 06:08:14,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {122926#true} assume true; {122926#true} is VALID [2022-04-15 06:08:14,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122926#true} {122926#true} #58#return; {122926#true} is VALID [2022-04-15 06:08:14,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {122926#true} call #t~ret5 := main(); {122926#true} is VALID [2022-04-15 06:08:14,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {122926#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {123020#(<= main_~i~0 0)} is VALID [2022-04-15 06:08:14,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {123020#(<= main_~i~0 0)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {123020#(<= main_~i~0 0)} is VALID [2022-04-15 06:08:14,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {123020#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:14,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {122932#(<= main_~i~0 1)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122932#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:14,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {122932#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:14,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {122933#(<= main_~i~0 2)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122933#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:14,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {122933#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:14,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {122934#(<= main_~i~0 3)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122934#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:14,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {122934#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:14,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {122935#(<= main_~i~0 4)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122935#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:14,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {122935#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:14,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {122936#(<= main_~i~0 5)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122936#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:14,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {122936#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:14,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {122937#(<= main_~i~0 6)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122937#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:14,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {122937#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:14,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {122938#(<= main_~i~0 7)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122938#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:14,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {122938#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:14,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {122939#(<= main_~i~0 8)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122939#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:14,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {122939#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:14,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {122940#(<= main_~i~0 9)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122940#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:14,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {122940#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:14,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {122941#(<= main_~i~0 10)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122941#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:14,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {122941#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:14,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {122942#(<= main_~i~0 11)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122942#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:14,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {122942#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:14,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {122943#(<= main_~i~0 12)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122943#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:14,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {122943#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:14,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {122944#(<= main_~i~0 13)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122944#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:14,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {122944#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:14,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {122945#(<= main_~i~0 14)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122945#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:14,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {122945#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:14,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {122946#(<= main_~i~0 15)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122946#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:14,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {122946#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:14,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {122947#(<= main_~i~0 16)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122947#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:14,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {122947#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:14,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {122948#(<= main_~i~0 17)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122948#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:14,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {122948#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:14,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {122949#(<= main_~i~0 18)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122949#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:14,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {122949#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:14,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {122950#(<= main_~i~0 19)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122950#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:14,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {122950#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:14,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {122951#(<= main_~i~0 20)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122951#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:14,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {122951#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:14,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {122952#(<= main_~i~0 21)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122952#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:14,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {122952#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:14,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {122953#(<= main_~i~0 22)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122953#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:14,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {122953#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:14,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {122954#(<= main_~i~0 23)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122954#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:14,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {122954#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:14,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {122955#(<= main_~i~0 24)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122955#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:14,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {122955#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:14,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {122956#(<= main_~i~0 25)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122956#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:14,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {122956#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:14,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {122957#(<= main_~i~0 26)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122957#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:14,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {122957#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:14,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {122958#(<= main_~i~0 27)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122958#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:14,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {122958#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:14,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {122959#(<= main_~i~0 28)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122959#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:14,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {122959#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:14,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {122960#(<= main_~i~0 29)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122960#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:14,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {122960#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:14,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {122961#(<= main_~i~0 30)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122961#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:14,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {122961#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:14,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {122962#(<= main_~i~0 31)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122962#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:14,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {122962#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:14,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {122963#(<= main_~i~0 32)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122963#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:14,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {122963#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:14,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {122964#(<= main_~i~0 33)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122964#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:14,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {122964#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:14,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {122965#(<= main_~i~0 34)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122965#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:14,513 INFO L290 TraceCheckUtils]: 75: Hoare triple {122965#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:14,514 INFO L290 TraceCheckUtils]: 76: Hoare triple {122966#(<= main_~i~0 35)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122966#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:14,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {122966#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:14,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {122967#(<= main_~i~0 36)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122967#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:14,515 INFO L290 TraceCheckUtils]: 79: Hoare triple {122967#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:14,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {122968#(<= main_~i~0 37)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122968#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:14,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {122968#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:14,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {122969#(<= main_~i~0 38)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122969#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:14,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {122969#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:14,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {122970#(<= main_~i~0 39)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122970#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:14,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {122970#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:14,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {122971#(<= main_~i~0 40)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122971#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:14,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {122971#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:14,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {122972#(<= main_~i~0 41)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122972#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:14,518 INFO L290 TraceCheckUtils]: 89: Hoare triple {122972#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:14,518 INFO L290 TraceCheckUtils]: 90: Hoare triple {122973#(<= main_~i~0 42)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122973#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:14,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {122973#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:14,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {122974#(<= main_~i~0 43)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122974#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:14,519 INFO L290 TraceCheckUtils]: 93: Hoare triple {122974#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:14,519 INFO L290 TraceCheckUtils]: 94: Hoare triple {122975#(<= main_~i~0 44)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122975#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:14,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {122975#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:14,520 INFO L290 TraceCheckUtils]: 96: Hoare triple {122976#(<= main_~i~0 45)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122976#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:14,520 INFO L290 TraceCheckUtils]: 97: Hoare triple {122976#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:14,521 INFO L290 TraceCheckUtils]: 98: Hoare triple {122977#(<= main_~i~0 46)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122977#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:14,521 INFO L290 TraceCheckUtils]: 99: Hoare triple {122977#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:14,521 INFO L290 TraceCheckUtils]: 100: Hoare triple {122978#(<= main_~i~0 47)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122978#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:14,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {122978#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:14,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {122979#(<= main_~i~0 48)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122979#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:14,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {122979#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:14,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {122980#(<= main_~i~0 49)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122980#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:14,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {122980#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:14,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {122981#(<= main_~i~0 50)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122981#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:14,524 INFO L290 TraceCheckUtils]: 107: Hoare triple {122981#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:14,524 INFO L290 TraceCheckUtils]: 108: Hoare triple {122982#(<= main_~i~0 51)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122982#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:14,524 INFO L290 TraceCheckUtils]: 109: Hoare triple {122982#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:14,525 INFO L290 TraceCheckUtils]: 110: Hoare triple {122983#(<= main_~i~0 52)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122983#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:14,525 INFO L290 TraceCheckUtils]: 111: Hoare triple {122983#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:14,525 INFO L290 TraceCheckUtils]: 112: Hoare triple {122984#(<= main_~i~0 53)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122984#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:14,526 INFO L290 TraceCheckUtils]: 113: Hoare triple {122984#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:14,526 INFO L290 TraceCheckUtils]: 114: Hoare triple {122985#(<= main_~i~0 54)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122985#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:14,526 INFO L290 TraceCheckUtils]: 115: Hoare triple {122985#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:14,527 INFO L290 TraceCheckUtils]: 116: Hoare triple {122986#(<= main_~i~0 55)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122986#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:14,527 INFO L290 TraceCheckUtils]: 117: Hoare triple {122986#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:14,527 INFO L290 TraceCheckUtils]: 118: Hoare triple {122987#(<= main_~i~0 56)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122987#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:14,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {122987#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:14,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {122988#(<= main_~i~0 57)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122988#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:14,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {122988#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:14,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {122989#(<= main_~i~0 58)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122989#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:14,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {122989#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:14,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {122990#(<= main_~i~0 59)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122990#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:14,530 INFO L290 TraceCheckUtils]: 125: Hoare triple {122990#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:14,530 INFO L290 TraceCheckUtils]: 126: Hoare triple {122991#(<= main_~i~0 60)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122991#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:14,530 INFO L290 TraceCheckUtils]: 127: Hoare triple {122991#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:14,531 INFO L290 TraceCheckUtils]: 128: Hoare triple {122992#(<= main_~i~0 61)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122992#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:14,531 INFO L290 TraceCheckUtils]: 129: Hoare triple {122992#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:14,531 INFO L290 TraceCheckUtils]: 130: Hoare triple {122993#(<= main_~i~0 62)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122993#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:14,532 INFO L290 TraceCheckUtils]: 131: Hoare triple {122993#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:14,532 INFO L290 TraceCheckUtils]: 132: Hoare triple {122994#(<= main_~i~0 63)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122994#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:14,532 INFO L290 TraceCheckUtils]: 133: Hoare triple {122994#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:14,533 INFO L290 TraceCheckUtils]: 134: Hoare triple {122995#(<= main_~i~0 64)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122995#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:14,533 INFO L290 TraceCheckUtils]: 135: Hoare triple {122995#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:14,533 INFO L290 TraceCheckUtils]: 136: Hoare triple {122996#(<= main_~i~0 65)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122996#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:14,534 INFO L290 TraceCheckUtils]: 137: Hoare triple {122996#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:14,534 INFO L290 TraceCheckUtils]: 138: Hoare triple {122997#(<= main_~i~0 66)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122997#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:14,534 INFO L290 TraceCheckUtils]: 139: Hoare triple {122997#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 06:08:14,535 INFO L290 TraceCheckUtils]: 140: Hoare triple {122998#(<= main_~i~0 67)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122998#(<= main_~i~0 67)} is VALID [2022-04-15 06:08:14,535 INFO L290 TraceCheckUtils]: 141: Hoare triple {122998#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 06:08:14,535 INFO L290 TraceCheckUtils]: 142: Hoare triple {122999#(<= main_~i~0 68)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {122999#(<= main_~i~0 68)} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 143: Hoare triple {122999#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {123000#(<= main_~i~0 69)} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 144: Hoare triple {123000#(<= main_~i~0 69)} assume !(~i~0 < 1023); {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {122927#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 146: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 147: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 148: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 149: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:14,536 INFO L290 TraceCheckUtils]: 150: Hoare triple {122927#false} assume !!(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 151: Hoare triple {122927#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 152: Hoare triple {122927#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 153: Hoare triple {122927#false} assume !(0 != #t~mem4);havoc #t~mem4; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L272 TraceCheckUtils]: 154: Hoare triple {122927#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 155: Hoare triple {122927#false} ~cond := #in~cond; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 156: Hoare triple {122927#false} assume 0 == ~cond; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L290 TraceCheckUtils]: 157: Hoare triple {122927#false} assume !false; {122927#false} is VALID [2022-04-15 06:08:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4768 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:08:14,538 INFO L328 TraceCheckSpWp]: Computing backward predicates...