/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:03,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:03,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:03,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:03,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:03,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:03,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:03,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:03,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:03,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:03,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:03,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:03,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:03,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:03,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:03,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:03,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:03,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:03,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:03,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:03,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:03,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:03,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:03,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:03,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:03,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:03,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:03,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:03,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:03,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:03,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:03,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:03,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:03,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:03,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:03,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:03,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:03,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:03,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:03,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:03,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:03,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:03,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:31:03,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:03,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:03,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:03,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:03,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:03,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:03,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:03,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:03,515 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:03,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:03,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:03,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:03,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:03,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:03,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:03,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:03,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:03,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:03,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:03,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:31:03,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:03,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:03,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:03,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:03,745 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:03,746 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-27 10:31:03,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b95fd51/f47ab59838554d12ae63c71a07e00a56/FLAG494d43898 [2022-04-27 10:31:04,127 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:04,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2022-04-27 10:31:04,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b95fd51/f47ab59838554d12ae63c71a07e00a56/FLAG494d43898 [2022-04-27 10:31:04,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b95fd51/f47ab59838554d12ae63c71a07e00a56 [2022-04-27 10:31:04,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:04,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:04,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:04,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:04,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:04,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2344e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04, skipping insertion in model container [2022-04-27 10:31:04,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:04,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:04,277 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-27 10:31:04,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:04,292 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:04,301 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-27 10:31:04,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:04,319 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:04,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04 WrapperNode [2022-04-27 10:31:04,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:04,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:04,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:04,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:04,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:04,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:04,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:04,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:04,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (1/1) ... [2022-04-27 10:31:04,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:04,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:31:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:31:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:04,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:04,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:04,468 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:04,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:04,594 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:04,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:04,605 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:31:04,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:04 BoogieIcfgContainer [2022-04-27 10:31:04,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:04,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:04,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:04,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:04,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:04" (1/3) ... [2022-04-27 10:31:04,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5811eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:04, skipping insertion in model container [2022-04-27 10:31:04,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:04" (2/3) ... [2022-04-27 10:31:04,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5811eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:04, skipping insertion in model container [2022-04-27 10:31:04,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:04" (3/3) ... [2022-04-27 10:31:04,623 INFO L111 eAbstractionObserver]: Analyzing ICFG array_4.i [2022-04-27 10:31:04,634 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:04,634 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:04,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:04,694 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@684f2f18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73e87e0f [2022-04-27 10:31:04,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:04,703 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-27 10:31:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:31:04,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:04,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:04,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -615726646, now seen corresponding path program 1 times [2022-04-27 10:31:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255980387] [2022-04-27 10:31:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:04,838 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-27 10:31:04,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:31:04,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-27 10:31:04,840 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-27 10:31:04,840 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-27 10:31:04,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:31:04,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-27 10:31:04,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-27 10:31:04,841 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-27 10:31:04,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 10:31:04,843 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-27 10:31:04,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-27 10:31:04,843 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-27 10:31:04,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 10:31:04,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:31:04,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:31:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255980387] [2022-04-27 10:31:04,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255980387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:04,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:04,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445315939] [2022-04-27 10:31:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:04,851 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-27 10:31:04,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:04,855 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-27 10:31:04,887 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-27 10:31:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:04,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:04,908 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-27 10:31:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:04,984 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 10:31:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:04,985 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-27 10:31:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:04,986 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-27 10:31:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 10:31:04,994 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-27 10:31:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 10:31:04,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-27 10:31:05,036 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-27 10:31:05,041 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:31:05,041 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:31:05,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:05,045 INFO L413 NwaCegarLoop]: 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-27 10:31:05,046 INFO L414 NwaCegarLoop]: 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-27 10:31:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:31:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:31:05,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:05,065 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-27 10:31:05,065 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-27 10:31:05,065 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-27 10:31:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,067 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:31:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:31:05,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,068 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-27 10:31:05,068 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-27 10:31:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,070 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:31:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:31:05,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:05,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:05,071 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-27 10:31:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 10:31:05,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-27 10:31:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:05,073 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 10:31:05,073 INFO L496 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-27 10:31:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:31:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:31:05,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:05,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:05,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:05,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash 238110415, now seen corresponding path program 1 times [2022-04-27 10:31:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:05,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534043564] [2022-04-27 10:31:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {145#true} is VALID [2022-04-27 10:31:05,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 10:31:05,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145#true} {145#true} #58#return; {145#true} is VALID [2022-04-27 10:31:05,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:05,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {145#true} is VALID [2022-04-27 10:31:05,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2022-04-27 10:31:05,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #58#return; {145#true} is VALID [2022-04-27 10:31:05,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret5 := main(); {145#true} is VALID [2022-04-27 10:31:05,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {150#(= main_~i~0 0)} is VALID [2022-04-27 10:31:05,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#(= main_~i~0 0)} assume !(~i~0 < 1023); {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#false} assume !(0 != #t~mem4);havoc #t~mem4; {146#false} is VALID [2022-04-27 10:31:05,146 INFO L272 TraceCheckUtils]: 10: Hoare triple {146#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#false} ~cond := #in~cond; {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume 0 == ~cond; {146#false} is VALID [2022-04-27 10:31:05,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-04-27 10:31:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534043564] [2022-04-27 10:31:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534043564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:05,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056474815] [2022-04-27 10:31:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:05,149 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-27 10:31:05,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:05,149 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-27 10:31:05,162 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-27 10:31:05,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:05,164 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-27 10:31:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,261 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 10:31:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:05,262 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-27 10:31:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:05,263 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-27 10:31:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-27 10:31:05,267 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-27 10:31:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-27 10:31:05,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-27 10:31:05,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:05,305 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:31:05,305 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 10:31:05,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:05,310 INFO L413 NwaCegarLoop]: 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-27 10:31:05,310 INFO L414 NwaCegarLoop]: 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-27 10:31:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 10:31:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-04-27 10:31:05,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:05,321 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-27 10:31:05,322 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-27 10:31:05,322 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-27 10:31:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,325 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 10:31:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 10:31:05,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,326 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-27 10:31:05,326 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-27 10:31:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,328 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 10:31:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 10:31:05,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:05,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:05,329 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-27 10:31:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 10:31:05,330 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-27 10:31:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:05,331 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 10:31:05,332 INFO L496 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-27 10:31:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 10:31:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:31:05,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:05,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:05,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:05,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1502803825, now seen corresponding path program 1 times [2022-04-27 10:31:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:05,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869523632] [2022-04-27 10:31:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {275#true} is VALID [2022-04-27 10:31:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 10:31:05,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #58#return; {275#true} is VALID [2022-04-27 10:31:05,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:05,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {275#true} is VALID [2022-04-27 10:31:05,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 10:31:05,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #58#return; {275#true} is VALID [2022-04-27 10:31:05,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret5 := main(); {275#true} is VALID [2022-04-27 10:31:05,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {280#(= main_~i~0 0)} is VALID [2022-04-27 10:31:05,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(= 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; {280#(= main_~i~0 0)} is VALID [2022-04-27 10:31:05,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {281#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~i~0 1)} assume !(~i~0 < 1023); {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} assume !(0 != #t~mem4);havoc #t~mem4; {276#false} is VALID [2022-04-27 10:31:05,468 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#false} ~cond := #in~cond; {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#false} assume 0 == ~cond; {276#false} is VALID [2022-04-27 10:31:05,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 10:31:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869523632] [2022-04-27 10:31:05,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869523632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104996577] [2022-04-27 10:31:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:05,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:05,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:05,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:31:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:31:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:05,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2022-04-27 10:31:05,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {275#true} is VALID [2022-04-27 10:31:05,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 10:31:05,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #58#return; {275#true} is VALID [2022-04-27 10:31:05,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret5 := main(); {275#true} is VALID [2022-04-27 10:31:05,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:05,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(<= 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; {301#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:05,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {281#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:05,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~i~0 1)} assume !(~i~0 < 1023); {276#false} is VALID [2022-04-27 10:31:05,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {276#false} is VALID [2022-04-27 10:31:05,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {276#false} is VALID [2022-04-27 10:31:05,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} assume !(0 != #t~mem4);havoc #t~mem4; {276#false} is VALID [2022-04-27 10:31:05,621 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {276#false} is VALID [2022-04-27 10:31:05,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#false} ~cond := #in~cond; {276#false} is VALID [2022-04-27 10:31:05,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#false} assume 0 == ~cond; {276#false} is VALID [2022-04-27 10:31:05,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 10:31:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:05,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:05,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 10:31:05,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#false} assume 0 == ~cond; {276#false} is VALID [2022-04-27 10:31:05,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#false} ~cond := #in~cond; {276#false} is VALID [2022-04-27 10:31:05,705 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {276#false} is VALID [2022-04-27 10:31:05,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} assume !(0 != #t~mem4);havoc #t~mem4; {276#false} is VALID [2022-04-27 10:31:05,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {276#false} is VALID [2022-04-27 10:31:05,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {276#false} is VALID [2022-04-27 10:31:05,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(< main_~i~0 1023)} assume !(~i~0 < 1023); {276#false} is VALID [2022-04-27 10:31:05,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {353#(< main_~i~0 1023)} is VALID [2022-04-27 10:31:05,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {357#(< 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; {357#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:05,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {357#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:05,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret5 := main(); {275#true} is VALID [2022-04-27 10:31:05,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #58#return; {275#true} is VALID [2022-04-27 10:31:05,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 10:31:05,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {275#true} is VALID [2022-04-27 10:31:05,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2022-04-27 10:31:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:05,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104996577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:05,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:05,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:31:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012252355] [2022-04-27 10:31:05,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:05,711 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:31:05,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:05,712 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:05,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:31:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:31:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:31:05,731 INFO L87 Difference]: Start difference. First operand 18 states and 19 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,877 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 10:31:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:31:05,877 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:31:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:05,877 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-04-27 10:31:05,879 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-04-27 10:31:05,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2022-04-27 10:31:05,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:05,923 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:31:05,923 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 10:31:05,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:31:05,926 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:05,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 26 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 10:31:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2022-04-27 10:31:05,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:05,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,936 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,936 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,940 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-27 10:31:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-27 10:31:05,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 10:31:05,941 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 10:31:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:05,947 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-27 10:31:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-04-27 10:31:05,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:05,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:05,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-27 10:31:05,952 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2022-04-27 10:31:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:05,952 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-27 10:31:05,952 INFO L496 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-27 10:31:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:31:05,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:05,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:05,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:06,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 5162583, now seen corresponding path program 2 times [2022-04-27 10:31:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:06,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264378597] [2022-04-27 10:31:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {577#true} is VALID [2022-04-27 10:31:06,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-27 10:31:06,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {577#true} {577#true} #58#return; {577#true} is VALID [2022-04-27 10:31:06,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:06,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {577#true} is VALID [2022-04-27 10:31:06,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-27 10:31:06,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #58#return; {577#true} is VALID [2022-04-27 10:31:06,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret5 := main(); {577#true} is VALID [2022-04-27 10:31:06,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {577#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {577#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {577#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {577#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {577#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {577#true} is VALID [2022-04-27 10:31:06,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {577#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {577#true} is VALID [2022-04-27 10:31:06,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {577#true} is VALID [2022-04-27 10:31:06,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {577#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {577#true} is VALID [2022-04-27 10:31:06,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {577#true} assume !(~i~0 < 1023); {577#true} is VALID [2022-04-27 10:31:06,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {577#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {582#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:06,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {582#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:06,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {582#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {582#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:06,286 INFO L272 TraceCheckUtils]: 18: Hoare triple {582#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:31:06,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {583#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {584#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:31:06,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {578#false} is VALID [2022-04-27 10:31:06,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {578#false} assume !false; {578#false} is VALID [2022-04-27 10:31:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:31:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:06,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264378597] [2022-04-27 10:31:06,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264378597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:06,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:06,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:31:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988586449] [2022-04-27 10:31:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:31:06,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:06,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,301 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-27 10:31:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:31:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:31:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:31:06,304 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:06,453 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 10:31:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:31:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:31:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 10:31:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 10:31:06,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-27 10:31:06,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:06,481 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:31:06,481 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 10:31:06,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:31:06,482 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:06,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 10:31:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 10:31:06,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:06,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,500 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,500 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:06,501 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 10:31:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 10:31:06,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:06,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:06,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 10:31:06,503 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 10:31:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:06,505 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 10:31:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 10:31:06,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:06,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:06,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:06,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-27 10:31:06,509 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-04-27 10:31:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:06,509 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-27 10:31:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 10:31:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:31:06,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:06,510 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:06,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:31:06,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1128685544, now seen corresponding path program 1 times [2022-04-27 10:31:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891436212] [2022-04-27 10:31:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {735#true} is VALID [2022-04-27 10:31:06,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-27 10:31:06,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {735#true} {735#true} #58#return; {735#true} is VALID [2022-04-27 10:31:06,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:06,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {735#true} is VALID [2022-04-27 10:31:06,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-27 10:31:06,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #58#return; {735#true} is VALID [2022-04-27 10:31:06,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret5 := main(); {735#true} is VALID [2022-04-27 10:31:06,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {735#true} is VALID [2022-04-27 10:31:06,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {735#true} is VALID [2022-04-27 10:31:06,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {735#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#true} is VALID [2022-04-27 10:31:06,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {735#true} assume !(~i~0 < 1023); {735#true} is VALID [2022-04-27 10:31:06,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {740#(= main_~i~0 0)} is VALID [2022-04-27 10:31:06,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {740#(= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {740#(= main_~i~0 0)} is VALID [2022-04-27 10:31:06,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {740#(= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {740#(= main_~i~0 0)} is VALID [2022-04-27 10:31:06,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {740#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {741#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:06,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {741#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {741#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:06,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {741#(<= main_~i~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {741#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:06,613 INFO L272 TraceCheckUtils]: 21: Hoare triple {741#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:31:06,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {742#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {743#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:31:06,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {743#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {736#false} is VALID [2022-04-27 10:31:06,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-27 10:31:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:31:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:06,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891436212] [2022-04-27 10:31:06,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891436212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:06,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740403602] [2022-04-27 10:31:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:06,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:06,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:31:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:31:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:06,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:06,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-27 10:31:06,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {735#true} is VALID [2022-04-27 10:31:06,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-27 10:31:06,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #58#return; {735#true} is VALID [2022-04-27 10:31:06,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret5 := main(); {735#true} is VALID [2022-04-27 10:31:06,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {763#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:06,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#(<= 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; {763#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:06,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {741#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:06,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(<= 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; {741#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:06,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {776#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:06,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(<= 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; {776#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:06,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {783#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:06,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(<= 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; {783#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {790#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#(<= main_~i~0 4)} assume !(~i~0 < 1023); {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {736#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {736#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {736#false} assume !!(0 != #t~mem4);havoc #t~mem4; {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {736#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {736#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {736#false} is VALID [2022-04-27 10:31:06,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {736#false} assume !(0 != #t~mem4);havoc #t~mem4; {736#false} is VALID [2022-04-27 10:31:06,820 INFO L272 TraceCheckUtils]: 21: Hoare triple {736#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {736#false} is VALID [2022-04-27 10:31:06,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-27 10:31:06,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-27 10:31:06,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-27 10:31:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:31:06,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:06,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {736#false} assume !false; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L272 TraceCheckUtils]: 21: Hoare triple {736#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {736#false} assume !(0 != #t~mem4);havoc #t~mem4; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {736#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {736#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {736#false} assume !!(0 != #t~mem4);havoc #t~mem4; {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {736#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {736#false} is VALID [2022-04-27 10:31:06,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {736#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {736#false} is VALID [2022-04-27 10:31:06,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {854#(< main_~i~0 1023)} assume !(~i~0 < 1023); {736#false} is VALID [2022-04-27 10:31:06,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {854#(< main_~i~0 1023)} is VALID [2022-04-27 10:31:06,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(< 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; {858#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:06,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {858#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:06,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {865#(< 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; {865#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:06,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {865#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:06,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(< 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; {872#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:06,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {872#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:06,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#(< 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; {879#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:06,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {879#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:06,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret5 := main(); {735#true} is VALID [2022-04-27 10:31:06,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #58#return; {735#true} is VALID [2022-04-27 10:31:06,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2022-04-27 10:31:06,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {735#true} is VALID [2022-04-27 10:31:06,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2022-04-27 10:31:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:31:06,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740403602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:06,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:06,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-04-27 10:31:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646687148] [2022-04-27 10:31:06,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:06,961 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:06,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:06,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:07,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:07,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:31:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:31:07,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:31:07,001 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:07,478 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-04-27 10:31:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:31:07,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-04-27 10:31:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-04-27 10:31:07,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 102 transitions. [2022-04-27 10:31:07,547 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-27 10:31:07,549 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:31:07,549 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 10:31:07,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:31:07,551 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 121 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:07,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 40 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 10:31:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-27 10:31:07,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:07,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 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-27 10:31:07,582 INFO L74 IsIncluded]: Start isIncluded. First operand 66 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-27 10:31:07,582 INFO L87 Difference]: Start difference. First operand 66 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-27 10:31:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:07,585 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-27 10:31:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-04-27 10:31:07,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:07,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:07,588 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 66 states. [2022-04-27 10:31:07,588 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 66 states. [2022-04-27 10:31:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:07,591 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-27 10:31:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-04-27 10:31:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:07,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:07,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:07,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:07,592 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-27 10:31:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2022-04-27 10:31:07,594 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 25 [2022-04-27 10:31:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:07,594 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2022-04-27 10:31:07,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-27 10:31:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 10:31:07,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:07,596 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:07,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:07,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:07,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -614389885, now seen corresponding path program 2 times [2022-04-27 10:31:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:07,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26758964] [2022-04-27 10:31:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:08,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {1308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1292#true} is VALID [2022-04-27 10:31:08,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1292#true} assume true; {1292#true} is VALID [2022-04-27 10:31:08,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1292#true} {1292#true} #58#return; {1292#true} is VALID [2022-04-27 10:31:08,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:08,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1292#true} is VALID [2022-04-27 10:31:08,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2022-04-27 10:31:08,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #58#return; {1292#true} is VALID [2022-04-27 10:31:08,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret5 := main(); {1292#true} is VALID [2022-04-27 10:31:08,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1297#(= main_~i~0 0)} is VALID [2022-04-27 10:31:08,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(= 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; {1297#(= main_~i~0 0)} is VALID [2022-04-27 10:31:08,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1298#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:08,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(<= 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; {1298#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:08,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1299#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:08,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1299#(<= 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; {1299#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:08,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1300#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:08,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {1300#(<= 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; {1300#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:08,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1301#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:08,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {1301#(<= 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; {1301#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:08,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {1301#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1302#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:08,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= 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; {1302#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:08,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1303#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:08,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {1303#(<= 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; {1303#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:08,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {1303#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1304#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:08,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1304#(<= 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; {1304#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:08,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {1304#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1305#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:08,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {1305#(<= 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; {1305#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:08,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {1305#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1306#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:08,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#(<= 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; {1306#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1307#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {1307#(<= main_~i~0 10)} assume !(~i~0 < 1023); {1293#false} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {1293#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1293#false} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {1293#false} assume !(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,032 INFO L272 TraceCheckUtils]: 60: Hoare triple {1293#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1293#false} is VALID [2022-04-27 10:31:08,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2022-04-27 10:31:08,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {1293#false} assume 0 == ~cond; {1293#false} is VALID [2022-04-27 10:31:08,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2022-04-27 10:31:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-27 10:31:08,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26758964] [2022-04-27 10:31:08,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26758964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287138870] [2022-04-27 10:31:08,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:08,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:08,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:08,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:08,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:31:08,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:08,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:08,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:31:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:08,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:08,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2022-04-27 10:31:08,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1292#true} is VALID [2022-04-27 10:31:08,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2022-04-27 10:31:08,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #58#return; {1292#true} is VALID [2022-04-27 10:31:08,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret5 := main(); {1292#true} is VALID [2022-04-27 10:31:08,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1327#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:08,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(<= 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; {1327#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:08,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1298#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:08,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1298#(<= 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; {1298#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:08,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1298#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1299#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:08,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {1299#(<= 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; {1299#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:08,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1300#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:08,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {1300#(<= 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; {1300#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:08,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1301#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:08,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {1301#(<= 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; {1301#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:08,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1301#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1302#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:08,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= 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; {1302#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:08,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1303#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:08,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1303#(<= 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; {1303#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:08,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {1303#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1304#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:08,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1304#(<= 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; {1304#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:08,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {1304#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1305#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:08,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1305#(<= 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; {1305#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:08,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {1305#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1306#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:08,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#(<= 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; {1306#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:08,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1307#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {1307#(<= main_~i~0 10)} assume !(~i~0 < 1023); {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {1293#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {1293#false} assume !(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L272 TraceCheckUtils]: 60: Hoare triple {1293#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {1293#false} assume 0 == ~cond; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2022-04-27 10:31:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-27 10:31:08,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {1293#false} assume 0 == ~cond; {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L272 TraceCheckUtils]: 60: Hoare triple {1293#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {1293#false} assume !(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {1293#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {1293#false} assume !!(0 != #t~mem4);havoc #t~mem4; {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {1293#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1293#false} is VALID [2022-04-27 10:31:08,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {1293#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {1293#false} is VALID [2022-04-27 10:31:08,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {1613#(< main_~i~0 1023)} assume !(~i~0 < 1023); {1293#false} is VALID [2022-04-27 10:31:08,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {1617#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1613#(< main_~i~0 1023)} is VALID [2022-04-27 10:31:08,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1617#(< 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; {1617#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:08,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {1624#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1617#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:08,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {1624#(< 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; {1624#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:08,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1624#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:08,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {1631#(< 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; {1631#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:08,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {1638#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1631#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:08,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(< 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; {1638#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:08,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {1645#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1638#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:08,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1645#(< 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; {1645#(< main_~i~0 1018)} is VALID [2022-04-27 10:31:08,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1645#(< main_~i~0 1018)} is VALID [2022-04-27 10:31:08,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1652#(< 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; {1652#(< main_~i~0 1017)} is VALID [2022-04-27 10:31:08,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1652#(< main_~i~0 1017)} is VALID [2022-04-27 10:31:08,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(< 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; {1659#(< main_~i~0 1016)} is VALID [2022-04-27 10:31:08,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {1666#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1659#(< main_~i~0 1016)} is VALID [2022-04-27 10:31:08,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {1666#(< 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; {1666#(< main_~i~0 1015)} is VALID [2022-04-27 10:31:08,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1673#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1666#(< main_~i~0 1015)} is VALID [2022-04-27 10:31:08,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1673#(< 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; {1673#(< main_~i~0 1014)} is VALID [2022-04-27 10:31:08,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {1680#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1673#(< main_~i~0 1014)} is VALID [2022-04-27 10:31:08,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#(< 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; {1680#(< main_~i~0 1013)} is VALID [2022-04-27 10:31:08,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1292#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1680#(< main_~i~0 1013)} is VALID [2022-04-27 10:31:08,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {1292#true} call #t~ret5 := main(); {1292#true} is VALID [2022-04-27 10:31:08,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1292#true} {1292#true} #58#return; {1292#true} is VALID [2022-04-27 10:31:08,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1292#true} assume true; {1292#true} is VALID [2022-04-27 10:31:08,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1292#true} is VALID [2022-04-27 10:31:08,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2022-04-27 10:31:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-27 10:31:08,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287138870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:08,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:08,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:31:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768796878] [2022-04-27 10:31:08,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 10:31:08,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:08,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:08,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:08,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:31:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:08,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:31:08,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:31:08,787 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:09,517 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2022-04-27 10:31:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:31:09,518 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-27 10:31:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 172 transitions. [2022-04-27 10:31:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 172 transitions. [2022-04-27 10:31:09,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 172 transitions. [2022-04-27 10:31:09,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:09,638 INFO L225 Difference]: With dead ends: 176 [2022-04-27 10:31:09,639 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 10:31:09,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:31:09,640 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 263 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:09,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 36 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:31:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 10:31:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 89. [2022-04-27 10:31:09,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:09,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 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-27 10:31:09,698 INFO L74 IsIncluded]: Start isIncluded. First operand 138 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-27 10:31:09,698 INFO L87 Difference]: Start difference. First operand 138 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-27 10:31:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:09,701 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-04-27 10:31:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2022-04-27 10:31:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:09,702 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 138 states. [2022-04-27 10:31:09,702 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 138 states. [2022-04-27 10:31:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:09,706 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-04-27 10:31:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2022-04-27 10:31:09,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:09,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:09,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:09,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:09,706 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-27 10:31:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-27 10:31:09,708 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 64 [2022-04-27 10:31:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:09,708 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-27 10:31:09,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-27 10:31:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 10:31:09,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:09,709 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:09,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:09,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:09,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2029631515, now seen corresponding path program 3 times [2022-04-27 10:31:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474955515] [2022-04-27 10:31:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:10,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {2434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-27 10:31:10,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-27 10:31:10,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #58#return; {2406#true} is VALID [2022-04-27 10:31:10,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:10,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {2434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-27 10:31:10,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-27 10:31:10,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #58#return; {2406#true} is VALID [2022-04-27 10:31:10,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret5 := main(); {2406#true} is VALID [2022-04-27 10:31:10,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2411#(= main_~i~0 0)} is VALID [2022-04-27 10:31:10,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(= 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; {2411#(= main_~i~0 0)} is VALID [2022-04-27 10:31:10,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2412#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:10,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(<= 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; {2412#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:10,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:10,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {2413#(<= 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; {2413#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:10,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2414#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:10,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {2414#(<= 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; {2414#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:10,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {2414#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2415#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:10,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2415#(<= 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; {2415#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:10,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {2415#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2416#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:10,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2416#(<= 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; {2416#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:10,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {2416#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2417#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:10,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {2417#(<= 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; {2417#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:10,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {2417#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2418#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:10,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#(<= 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; {2418#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:10,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2419#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:10,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {2419#(<= 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; {2419#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:10,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {2419#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2420#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:10,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= 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; {2420#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:10,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {2420#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2421#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:10,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {2421#(<= 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; {2421#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:10,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2421#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2422#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:10,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {2422#(<= 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; {2422#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:10,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {2422#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2423#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:10,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {2423#(<= 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; {2423#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:10,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {2423#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2424#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:10,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {2424#(<= 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; {2424#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:10,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {2424#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2425#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:10,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {2425#(<= 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; {2425#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:10,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {2425#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2426#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:10,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {2426#(<= 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; {2426#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:10,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {2426#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2427#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:10,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {2427#(<= 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; {2427#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:10,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {2427#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2428#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:10,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {2428#(<= 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; {2428#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:10,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {2428#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2429#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:10,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {2429#(<= 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; {2429#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:10,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {2429#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2430#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:10,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {2430#(<= 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; {2430#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:10,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {2430#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2431#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:10,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {2431#(<= 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; {2431#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:10,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {2431#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2432#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:10,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {2432#(<= 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; {2432#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {2432#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2433#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {2433#(<= main_~i~0 22)} assume !(~i~0 < 1023); {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {2407#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 63: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 64: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 65: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {2407#false} assume !!(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {2407#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {2407#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 83: Hoare triple {2407#false} assume !(0 != #t~mem4);havoc #t~mem4; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L272 TraceCheckUtils]: 84: Hoare triple {2407#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-27 10:31:10,246 INFO L290 TraceCheckUtils]: 87: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-27 10:31:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-27 10:31:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:10,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474955515] [2022-04-27 10:31:10,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474955515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:10,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227316070] [2022-04-27 10:31:10,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:10,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:10,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:31:10,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:31:10,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:10,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 10:31:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:10,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:10,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #58#return; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret5 := main(); {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:10,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:10,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {2406#true} assume !(~i~0 < 1023); {2406#true} is VALID [2022-04-27 10:31:10,745 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2591#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:10,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {2591#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2591#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:10,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {2591#(<= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {2591#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:10,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {2591#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2412#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:10,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {2412#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:10,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {2412#(<= main_~i~0 1)} assume !!(0 != #t~mem4);havoc #t~mem4; {2412#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:10,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {2412#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2413#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:10,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {2413#(<= main_~i~0 2)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:10,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {2413#(<= main_~i~0 2)} assume !!(0 != #t~mem4);havoc #t~mem4; {2413#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:10,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {2413#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2414#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:10,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {2414#(<= main_~i~0 3)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:10,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {2414#(<= main_~i~0 3)} assume !!(0 != #t~mem4);havoc #t~mem4; {2414#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:10,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {2414#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2415#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:10,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {2415#(<= main_~i~0 4)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:10,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {2415#(<= main_~i~0 4)} assume !!(0 != #t~mem4);havoc #t~mem4; {2415#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:10,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {2415#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2416#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:10,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {2416#(<= main_~i~0 5)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:10,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {2416#(<= main_~i~0 5)} assume !!(0 != #t~mem4);havoc #t~mem4; {2416#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:10,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {2416#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2417#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:10,751 INFO L290 TraceCheckUtils]: 70: Hoare triple {2417#(<= main_~i~0 6)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:10,751 INFO L290 TraceCheckUtils]: 71: Hoare triple {2417#(<= main_~i~0 6)} assume !!(0 != #t~mem4);havoc #t~mem4; {2417#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:10,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {2417#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2418#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:10,751 INFO L290 TraceCheckUtils]: 73: Hoare triple {2418#(<= main_~i~0 7)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:10,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {2418#(<= main_~i~0 7)} assume !!(0 != #t~mem4);havoc #t~mem4; {2418#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:10,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {2418#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2419#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:10,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {2419#(<= main_~i~0 8)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:10,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {2419#(<= main_~i~0 8)} assume !!(0 != #t~mem4);havoc #t~mem4; {2419#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:10,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {2419#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2420#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:10,753 INFO L290 TraceCheckUtils]: 79: Hoare triple {2420#(<= main_~i~0 9)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2420#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:10,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {2420#(<= main_~i~0 9)} assume !!(0 != #t~mem4);havoc #t~mem4; {2420#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:10,753 INFO L290 TraceCheckUtils]: 81: Hoare triple {2420#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2421#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:10,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {2421#(<= main_~i~0 10)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2421#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:10,754 INFO L290 TraceCheckUtils]: 83: Hoare triple {2421#(<= main_~i~0 10)} assume !(0 != #t~mem4);havoc #t~mem4; {2421#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:10,754 INFO L272 TraceCheckUtils]: 84: Hoare triple {2421#(<= main_~i~0 10)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:10,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:10,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2407#false} is VALID [2022-04-27 10:31:10,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-27 10:31:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-27 10:31:10,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:11,220 INFO L290 TraceCheckUtils]: 87: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-27 10:31:11,220 INFO L290 TraceCheckUtils]: 86: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2407#false} is VALID [2022-04-27 10:31:11,221 INFO L290 TraceCheckUtils]: 85: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:11,221 INFO L272 TraceCheckUtils]: 84: Hoare triple {2711#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:11,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {2711#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {2711#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:11,222 INFO L290 TraceCheckUtils]: 82: Hoare triple {2711#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2711#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:11,222 INFO L290 TraceCheckUtils]: 81: Hoare triple {2721#(<= main_~i~0 1023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2711#(<= main_~i~0 1024)} is VALID [2022-04-27 10:31:11,222 INFO L290 TraceCheckUtils]: 80: Hoare triple {2721#(<= main_~i~0 1023)} assume !!(0 != #t~mem4);havoc #t~mem4; {2721#(<= main_~i~0 1023)} is VALID [2022-04-27 10:31:11,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {2721#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2721#(<= main_~i~0 1023)} is VALID [2022-04-27 10:31:11,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {2731#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2721#(<= main_~i~0 1023)} is VALID [2022-04-27 10:31:11,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {2731#(<= main_~i~0 1022)} assume !!(0 != #t~mem4);havoc #t~mem4; {2731#(<= main_~i~0 1022)} is VALID [2022-04-27 10:31:11,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {2731#(<= main_~i~0 1022)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 1022)} is VALID [2022-04-27 10:31:11,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {2741#(<= main_~i~0 1021)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2731#(<= main_~i~0 1022)} is VALID [2022-04-27 10:31:11,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {2741#(<= main_~i~0 1021)} assume !!(0 != #t~mem4);havoc #t~mem4; {2741#(<= main_~i~0 1021)} is VALID [2022-04-27 10:31:11,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {2741#(<= main_~i~0 1021)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2741#(<= main_~i~0 1021)} is VALID [2022-04-27 10:31:11,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {2751#(<= main_~i~0 1020)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2741#(<= main_~i~0 1021)} is VALID [2022-04-27 10:31:11,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {2751#(<= main_~i~0 1020)} assume !!(0 != #t~mem4);havoc #t~mem4; {2751#(<= main_~i~0 1020)} is VALID [2022-04-27 10:31:11,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {2751#(<= main_~i~0 1020)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2751#(<= main_~i~0 1020)} is VALID [2022-04-27 10:31:11,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {2761#(<= main_~i~0 1019)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2751#(<= main_~i~0 1020)} is VALID [2022-04-27 10:31:11,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {2761#(<= main_~i~0 1019)} assume !!(0 != #t~mem4);havoc #t~mem4; {2761#(<= main_~i~0 1019)} is VALID [2022-04-27 10:31:11,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {2761#(<= main_~i~0 1019)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2761#(<= main_~i~0 1019)} is VALID [2022-04-27 10:31:11,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {2771#(<= main_~i~0 1018)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2761#(<= main_~i~0 1019)} is VALID [2022-04-27 10:31:11,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {2771#(<= main_~i~0 1018)} assume !!(0 != #t~mem4);havoc #t~mem4; {2771#(<= main_~i~0 1018)} is VALID [2022-04-27 10:31:11,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {2771#(<= main_~i~0 1018)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2771#(<= main_~i~0 1018)} is VALID [2022-04-27 10:31:11,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {2781#(<= main_~i~0 1017)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2771#(<= main_~i~0 1018)} is VALID [2022-04-27 10:31:11,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {2781#(<= main_~i~0 1017)} assume !!(0 != #t~mem4);havoc #t~mem4; {2781#(<= main_~i~0 1017)} is VALID [2022-04-27 10:31:11,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {2781#(<= main_~i~0 1017)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2781#(<= main_~i~0 1017)} is VALID [2022-04-27 10:31:11,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {2791#(<= main_~i~0 1016)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2781#(<= main_~i~0 1017)} is VALID [2022-04-27 10:31:11,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {2791#(<= main_~i~0 1016)} assume !!(0 != #t~mem4);havoc #t~mem4; {2791#(<= main_~i~0 1016)} is VALID [2022-04-27 10:31:11,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {2791#(<= main_~i~0 1016)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2791#(<= main_~i~0 1016)} is VALID [2022-04-27 10:31:11,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {2801#(<= main_~i~0 1015)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2791#(<= main_~i~0 1016)} is VALID [2022-04-27 10:31:11,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {2801#(<= main_~i~0 1015)} assume !!(0 != #t~mem4);havoc #t~mem4; {2801#(<= main_~i~0 1015)} is VALID [2022-04-27 10:31:11,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {2801#(<= main_~i~0 1015)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2801#(<= main_~i~0 1015)} is VALID [2022-04-27 10:31:11,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {2811#(<= main_~i~0 1014)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2801#(<= main_~i~0 1015)} is VALID [2022-04-27 10:31:11,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {2811#(<= main_~i~0 1014)} assume !!(0 != #t~mem4);havoc #t~mem4; {2811#(<= main_~i~0 1014)} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {2811#(<= main_~i~0 1014)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {2811#(<= main_~i~0 1014)} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#true} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {2811#(<= main_~i~0 1014)} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {2406#true} assume !(~i~0 < 1023); {2406#true} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#true} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret5 := main(); {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #58#return; {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-27 10:31:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-27 10:31:11,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227316070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:11,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 40 [2022-04-27 10:31:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566877423] [2022-04-27 10:31:11,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-27 10:31:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:11,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:11,319 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-27 10:31:11,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 10:31:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 10:31:11,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=888, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 10:31:11,321 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:13,047 INFO L93 Difference]: Finished difference Result 246 states and 281 transitions. [2022-04-27 10:31:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 10:31:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-27 10:31:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 252 transitions. [2022-04-27 10:31:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 252 transitions. [2022-04-27 10:31:13,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 252 transitions. [2022-04-27 10:31:13,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:13,278 INFO L225 Difference]: With dead ends: 246 [2022-04-27 10:31:13,279 INFO L226 Difference]: Without dead ends: 182 [2022-04-27 10:31:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1941, Invalid=3759, Unknown=0, NotChecked=0, Total=5700 [2022-04-27 10:31:13,281 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 426 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:13,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 39 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:31:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-27 10:31:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2022-04-27 10:31:13,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:13,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,470 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,471 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:13,474 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2022-04-27 10:31:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2022-04-27 10:31:13,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:13,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:13,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-27 10:31:13,475 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 182 states. [2022-04-27 10:31:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:13,478 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2022-04-27 10:31:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2022-04-27 10:31:13,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:13,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:13,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:13,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2022-04-27 10:31:13,481 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 88 [2022-04-27 10:31:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:13,482 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2022-04-27 10:31:13,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.225) internal successors, (129), 38 states have internal predecessors, (129), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2022-04-27 10:31:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-27 10:31:13,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:13,483 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:13,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:13,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1585710225, now seen corresponding path program 4 times [2022-04-27 10:31:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133615532] [2022-04-27 10:31:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:14,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {4096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4058#true} is VALID [2022-04-27 10:31:14,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {4058#true} assume true; {4058#true} is VALID [2022-04-27 10:31:14,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4058#true} {4058#true} #58#return; {4058#true} is VALID [2022-04-27 10:31:14,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {4058#true} call ULTIMATE.init(); {4096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:14,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {4096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4058#true} is VALID [2022-04-27 10:31:14,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {4058#true} assume true; {4058#true} is VALID [2022-04-27 10:31:14,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4058#true} {4058#true} #58#return; {4058#true} is VALID [2022-04-27 10:31:14,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {4058#true} call #t~ret5 := main(); {4058#true} is VALID [2022-04-27 10:31:14,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {4058#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4063#(= main_~i~0 0)} is VALID [2022-04-27 10:31:14,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {4063#(= 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; {4063#(= main_~i~0 0)} is VALID [2022-04-27 10:31:14,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {4063#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4064#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:14,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(<= 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; {4064#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:14,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4065#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:14,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {4065#(<= 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; {4065#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:14,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {4065#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4066#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:14,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {4066#(<= 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; {4066#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:14,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {4066#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4067#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:14,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#(<= 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; {4067#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:14,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {4067#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4068#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:14,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {4068#(<= 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; {4068#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:14,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {4068#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4069#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:14,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {4069#(<= 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; {4069#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:14,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4069#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4070#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:14,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {4070#(<= 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; {4070#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:14,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {4070#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4071#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:14,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {4071#(<= 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; {4071#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:14,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {4071#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4072#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:14,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {4072#(<= 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; {4072#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:14,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {4072#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4073#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:14,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {4073#(<= 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; {4073#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:14,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {4073#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4074#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:14,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {4074#(<= 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; {4074#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:14,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {4074#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4075#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:14,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {4075#(<= 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; {4075#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:14,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {4075#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4076#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:14,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {4076#(<= 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; {4076#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:14,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {4076#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4077#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:14,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {4077#(<= 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; {4077#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:14,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {4077#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4078#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:14,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {4078#(<= 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; {4078#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:14,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {4078#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4079#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:14,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= 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; {4079#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:14,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:14,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {4080#(<= 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; {4080#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:14,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {4080#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4081#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:14,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {4081#(<= 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; {4081#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:14,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {4081#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4082#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:14,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {4082#(<= 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; {4082#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:14,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {4082#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4083#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:14,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {4083#(<= 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; {4083#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:14,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {4083#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4084#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:14,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {4084#(<= 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; {4084#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:14,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {4084#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4085#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:14,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {4085#(<= 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; {4085#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:14,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {4085#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4086#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:14,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {4086#(<= 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; {4086#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:14,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {4086#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4087#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:14,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {4087#(<= 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; {4087#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:14,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {4087#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4088#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:14,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {4088#(<= 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; {4088#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:14,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {4088#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4089#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:14,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {4089#(<= 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; {4089#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:14,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {4089#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4090#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:14,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {4090#(<= 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; {4090#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:14,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {4090#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4091#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:14,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {4091#(<= 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; {4091#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:14,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {4091#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4092#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:14,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {4092#(<= 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; {4092#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:14,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {4092#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4093#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:14,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {4093#(<= 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; {4093#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:14,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {4093#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4094#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:14,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {4094#(<= 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; {4094#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:14,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {4094#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4095#(<= main_~i~0 32)} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {4095#(<= main_~i~0 32)} assume !(~i~0 < 1023); {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {4059#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 82: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,249 INFO L290 TraceCheckUtils]: 83: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 85: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 86: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 87: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 88: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 90: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 91: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 92: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 93: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 94: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 95: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 97: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 104: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 105: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 106: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 107: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 108: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 109: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 110: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 111: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 112: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 113: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 114: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,251 INFO L290 TraceCheckUtils]: 115: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 116: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 117: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 118: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 119: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 120: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 121: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 122: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 123: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 124: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 125: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 126: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 127: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 128: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 129: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 130: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 131: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 132: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,252 INFO L290 TraceCheckUtils]: 133: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 134: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 135: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 136: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 137: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 138: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 139: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 140: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 141: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 142: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 143: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 144: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 145: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 146: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 147: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 148: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 149: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 150: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 151: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 152: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 153: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,253 INFO L290 TraceCheckUtils]: 154: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 155: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 156: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 157: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 158: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 159: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 160: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 161: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 162: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 163: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 164: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 165: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 166: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 167: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 168: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 169: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 170: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 171: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 172: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 173: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 174: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:14,254 INFO L290 TraceCheckUtils]: 175: Hoare triple {4059#false} assume !(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:14,255 INFO L272 TraceCheckUtils]: 176: Hoare triple {4059#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4059#false} is VALID [2022-04-27 10:31:14,255 INFO L290 TraceCheckUtils]: 177: Hoare triple {4059#false} ~cond := #in~cond; {4059#false} is VALID [2022-04-27 10:31:14,255 INFO L290 TraceCheckUtils]: 178: Hoare triple {4059#false} assume 0 == ~cond; {4059#false} is VALID [2022-04-27 10:31:14,255 INFO L290 TraceCheckUtils]: 179: Hoare triple {4059#false} assume !false; {4059#false} is VALID [2022-04-27 10:31:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:31:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133615532] [2022-04-27 10:31:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133615532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477559250] [2022-04-27 10:31:14,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:31:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:14,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:14,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:31:14,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:31:14,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:14,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 10:31:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:14,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:15,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {4058#true} call ULTIMATE.init(); {4058#true} is VALID [2022-04-27 10:31:15,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {4058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4058#true} is VALID [2022-04-27 10:31:15,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {4058#true} assume true; {4058#true} is VALID [2022-04-27 10:31:15,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4058#true} {4058#true} #58#return; {4058#true} is VALID [2022-04-27 10:31:15,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {4058#true} call #t~ret5 := main(); {4058#true} is VALID [2022-04-27 10:31:15,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {4058#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4115#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:15,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {4115#(<= 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; {4115#(<= main_~i~0 0)} is VALID [2022-04-27 10:31:15,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {4115#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4064#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:15,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(<= 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; {4064#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:15,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4065#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:15,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {4065#(<= 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; {4065#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:15,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {4065#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4066#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:15,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {4066#(<= 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; {4066#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:15,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {4066#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4067#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:15,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#(<= 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; {4067#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:15,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {4067#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4068#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:15,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {4068#(<= 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; {4068#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:15,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {4068#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4069#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:15,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {4069#(<= 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; {4069#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:15,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {4069#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4070#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:15,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {4070#(<= 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; {4070#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:15,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {4070#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4071#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:15,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {4071#(<= 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; {4071#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:15,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {4071#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4072#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:15,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {4072#(<= 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; {4072#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:15,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {4072#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4073#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:15,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {4073#(<= 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; {4073#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:15,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {4073#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4074#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:15,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {4074#(<= 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; {4074#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:15,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {4074#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4075#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:15,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {4075#(<= 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; {4075#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:15,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {4075#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4076#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:15,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {4076#(<= 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; {4076#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:15,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {4076#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4077#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:15,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {4077#(<= 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; {4077#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:15,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {4077#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4078#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:15,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {4078#(<= 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; {4078#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:15,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {4078#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4079#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:15,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= 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; {4079#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:15,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4080#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:15,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {4080#(<= 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; {4080#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:15,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {4080#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4081#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:15,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {4081#(<= 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; {4081#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:15,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {4081#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4082#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:15,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {4082#(<= 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; {4082#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:15,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {4082#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4083#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:15,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {4083#(<= 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; {4083#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:15,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {4083#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4084#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:15,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {4084#(<= 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; {4084#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:15,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {4084#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4085#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:15,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {4085#(<= 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; {4085#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:15,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {4085#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4086#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:15,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {4086#(<= 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; {4086#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:15,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {4086#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4087#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:15,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {4087#(<= 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; {4087#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:15,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {4087#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4088#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:15,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {4088#(<= 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; {4088#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:15,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {4088#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4089#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:15,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {4089#(<= 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; {4089#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:15,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {4089#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4090#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:15,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {4090#(<= 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; {4090#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:15,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {4090#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4091#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:15,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {4091#(<= 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; {4091#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:15,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {4091#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4092#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:15,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {4092#(<= 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; {4092#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:15,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {4092#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4093#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:15,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {4093#(<= 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; {4093#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:15,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {4093#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4094#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:15,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {4094#(<= 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; {4094#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 69: Hoare triple {4094#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4095#(<= main_~i~0 32)} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 70: Hoare triple {4095#(<= main_~i~0 32)} assume !(~i~0 < 1023); {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 71: Hoare triple {4059#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 72: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 73: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 83: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 84: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 85: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 90: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 93: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 99: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 103: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 104: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 105: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 106: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 107: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 108: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 109: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 111: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 112: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 113: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 114: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 115: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 116: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 117: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,059 INFO L290 TraceCheckUtils]: 118: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 119: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 120: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 121: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 122: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 123: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 124: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 125: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 126: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 127: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 128: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 129: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 130: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 131: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 132: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 133: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 134: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 135: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 136: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 137: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,060 INFO L290 TraceCheckUtils]: 138: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 139: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 140: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 141: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 142: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 143: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 144: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 145: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 146: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 147: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 148: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 149: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 150: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 151: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 152: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 153: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 154: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 155: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 156: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 157: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 158: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,061 INFO L290 TraceCheckUtils]: 159: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 160: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 161: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 162: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 163: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 164: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 165: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 166: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 167: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 168: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 169: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 170: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 171: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 172: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 173: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 174: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 175: Hoare triple {4059#false} assume !(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L272 TraceCheckUtils]: 176: Hoare triple {4059#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 177: Hoare triple {4059#false} ~cond := #in~cond; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 178: Hoare triple {4059#false} assume 0 == ~cond; {4059#false} is VALID [2022-04-27 10:31:15,062 INFO L290 TraceCheckUtils]: 179: Hoare triple {4059#false} assume !false; {4059#false} is VALID [2022-04-27 10:31:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:31:15,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:16,653 INFO L290 TraceCheckUtils]: 179: Hoare triple {4059#false} assume !false; {4059#false} is VALID [2022-04-27 10:31:16,653 INFO L290 TraceCheckUtils]: 178: Hoare triple {4059#false} assume 0 == ~cond; {4059#false} is VALID [2022-04-27 10:31:16,653 INFO L290 TraceCheckUtils]: 177: Hoare triple {4059#false} ~cond := #in~cond; {4059#false} is VALID [2022-04-27 10:31:16,653 INFO L272 TraceCheckUtils]: 176: Hoare triple {4059#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {4059#false} is VALID [2022-04-27 10:31:16,653 INFO L290 TraceCheckUtils]: 175: Hoare triple {4059#false} assume !(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 174: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 173: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 172: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 171: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 170: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 169: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 168: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 167: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 166: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 165: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 164: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 163: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 162: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 161: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 160: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 159: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 158: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 157: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 156: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,654 INFO L290 TraceCheckUtils]: 155: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 154: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 153: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 152: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 151: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 150: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 149: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 148: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 147: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 146: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 145: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 144: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 143: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 142: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 141: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 140: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 139: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 138: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 137: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 136: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,655 INFO L290 TraceCheckUtils]: 135: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 134: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 133: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 132: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 131: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 130: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 129: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 128: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 127: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 126: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 125: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 124: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 123: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 122: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 121: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 120: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 119: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 118: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 117: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 116: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,656 INFO L290 TraceCheckUtils]: 115: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 114: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 112: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 111: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 102: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 101: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 100: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 99: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 98: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 97: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 96: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,657 INFO L290 TraceCheckUtils]: 95: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 94: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 90: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 83: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,658 INFO L290 TraceCheckUtils]: 76: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {4059#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {4059#false} assume !!(0 != #t~mem4);havoc #t~mem4; {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {4059#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {4059#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {4965#(< main_~i~0 1023)} assume !(~i~0 < 1023); {4059#false} is VALID [2022-04-27 10:31:16,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {4969#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4965#(< main_~i~0 1023)} is VALID [2022-04-27 10:31:16,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {4969#(< 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; {4969#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:16,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {4976#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4969#(< main_~i~0 1022)} is VALID [2022-04-27 10:31:16,660 INFO L290 TraceCheckUtils]: 66: Hoare triple {4976#(< 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; {4976#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:16,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {4983#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4976#(< main_~i~0 1021)} is VALID [2022-04-27 10:31:16,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {4983#(< 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; {4983#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:16,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {4990#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4983#(< main_~i~0 1020)} is VALID [2022-04-27 10:31:16,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {4990#(< 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; {4990#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:16,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {4997#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4990#(< main_~i~0 1019)} is VALID [2022-04-27 10:31:16,662 INFO L290 TraceCheckUtils]: 60: Hoare triple {4997#(< 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; {4997#(< main_~i~0 1018)} is VALID [2022-04-27 10:31:16,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {5004#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4997#(< main_~i~0 1018)} is VALID [2022-04-27 10:31:16,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {5004#(< 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; {5004#(< main_~i~0 1017)} is VALID [2022-04-27 10:31:16,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {5011#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5004#(< main_~i~0 1017)} is VALID [2022-04-27 10:31:16,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {5011#(< 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; {5011#(< main_~i~0 1016)} is VALID [2022-04-27 10:31:16,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {5018#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5011#(< main_~i~0 1016)} is VALID [2022-04-27 10:31:16,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {5018#(< 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; {5018#(< main_~i~0 1015)} is VALID [2022-04-27 10:31:16,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {5025#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5018#(< main_~i~0 1015)} is VALID [2022-04-27 10:31:16,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {5025#(< 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; {5025#(< main_~i~0 1014)} is VALID [2022-04-27 10:31:16,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {5032#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5025#(< main_~i~0 1014)} is VALID [2022-04-27 10:31:16,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {5032#(< 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; {5032#(< main_~i~0 1013)} is VALID [2022-04-27 10:31:16,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {5039#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5032#(< main_~i~0 1013)} is VALID [2022-04-27 10:31:16,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {5039#(< 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; {5039#(< main_~i~0 1012)} is VALID [2022-04-27 10:31:16,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {5046#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5039#(< main_~i~0 1012)} is VALID [2022-04-27 10:31:16,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {5046#(< 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; {5046#(< main_~i~0 1011)} is VALID [2022-04-27 10:31:16,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {5053#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5046#(< main_~i~0 1011)} is VALID [2022-04-27 10:31:16,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {5053#(< 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; {5053#(< main_~i~0 1010)} is VALID [2022-04-27 10:31:16,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {5060#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5053#(< main_~i~0 1010)} is VALID [2022-04-27 10:31:16,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {5060#(< 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; {5060#(< main_~i~0 1009)} is VALID [2022-04-27 10:31:16,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {5067#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5060#(< main_~i~0 1009)} is VALID [2022-04-27 10:31:16,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {5067#(< 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; {5067#(< main_~i~0 1008)} is VALID [2022-04-27 10:31:16,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {5074#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5067#(< main_~i~0 1008)} is VALID [2022-04-27 10:31:16,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {5074#(< 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; {5074#(< main_~i~0 1007)} is VALID [2022-04-27 10:31:16,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {5081#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5074#(< main_~i~0 1007)} is VALID [2022-04-27 10:31:16,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {5081#(< 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; {5081#(< main_~i~0 1006)} is VALID [2022-04-27 10:31:16,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {5088#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5081#(< main_~i~0 1006)} is VALID [2022-04-27 10:31:16,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {5088#(< 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; {5088#(< main_~i~0 1005)} is VALID [2022-04-27 10:31:16,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {5095#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5088#(< main_~i~0 1005)} is VALID [2022-04-27 10:31:16,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {5095#(< 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; {5095#(< main_~i~0 1004)} is VALID [2022-04-27 10:31:16,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5095#(< main_~i~0 1004)} is VALID [2022-04-27 10:31:16,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#(< 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; {5102#(< main_~i~0 1003)} is VALID [2022-04-27 10:31:16,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {5109#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5102#(< main_~i~0 1003)} is VALID [2022-04-27 10:31:16,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {5109#(< 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; {5109#(< main_~i~0 1002)} is VALID [2022-04-27 10:31:16,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {5116#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5109#(< main_~i~0 1002)} is VALID [2022-04-27 10:31:16,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {5116#(< 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; {5116#(< main_~i~0 1001)} is VALID [2022-04-27 10:31:16,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {5123#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5116#(< main_~i~0 1001)} is VALID [2022-04-27 10:31:16,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {5123#(< 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; {5123#(< main_~i~0 1000)} is VALID [2022-04-27 10:31:16,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {5130#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5123#(< main_~i~0 1000)} is VALID [2022-04-27 10:31:16,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {5130#(< 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; {5130#(< main_~i~0 999)} is VALID [2022-04-27 10:31:16,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {5137#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5130#(< main_~i~0 999)} is VALID [2022-04-27 10:31:16,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {5137#(< 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; {5137#(< main_~i~0 998)} is VALID [2022-04-27 10:31:16,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {5144#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5137#(< main_~i~0 998)} is VALID [2022-04-27 10:31:16,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {5144#(< 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; {5144#(< main_~i~0 997)} is VALID [2022-04-27 10:31:16,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {5151#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5144#(< main_~i~0 997)} is VALID [2022-04-27 10:31:16,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {5151#(< 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; {5151#(< main_~i~0 996)} is VALID [2022-04-27 10:31:16,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {5158#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5151#(< main_~i~0 996)} is VALID [2022-04-27 10:31:16,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {5158#(< 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; {5158#(< main_~i~0 995)} is VALID [2022-04-27 10:31:16,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {5165#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5158#(< main_~i~0 995)} is VALID [2022-04-27 10:31:16,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {5165#(< 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; {5165#(< main_~i~0 994)} is VALID [2022-04-27 10:31:16,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {5172#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5165#(< main_~i~0 994)} is VALID [2022-04-27 10:31:16,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {5172#(< 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; {5172#(< main_~i~0 993)} is VALID [2022-04-27 10:31:16,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {5179#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5172#(< main_~i~0 993)} is VALID [2022-04-27 10:31:16,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {5179#(< 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; {5179#(< main_~i~0 992)} is VALID [2022-04-27 10:31:16,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {5186#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5179#(< main_~i~0 992)} is VALID [2022-04-27 10:31:16,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {5186#(< 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; {5186#(< main_~i~0 991)} is VALID [2022-04-27 10:31:16,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4058#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5186#(< main_~i~0 991)} is VALID [2022-04-27 10:31:16,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {4058#true} call #t~ret5 := main(); {4058#true} is VALID [2022-04-27 10:31:16,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4058#true} {4058#true} #58#return; {4058#true} is VALID [2022-04-27 10:31:16,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {4058#true} assume true; {4058#true} is VALID [2022-04-27 10:31:16,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {4058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4058#true} is VALID [2022-04-27 10:31:16,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {4058#true} call ULTIMATE.init(); {4058#true} is VALID [2022-04-27 10:31:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:31:16,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477559250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:16,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-27 10:31:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759684850] [2022-04-27 10:31:16,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:16,682 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2022-04-27 10:31:16,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:16,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:16,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:16,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-27 10:31:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-27 10:31:16,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2022-04-27 10:31:16,782 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:20,242 INFO L93 Difference]: Finished difference Result 488 states and 555 transitions. [2022-04-27 10:31:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-27 10:31:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 180 [2022-04-27 10:31:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 454 transitions. [2022-04-27 10:31:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 454 transitions. [2022-04-27 10:31:20,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 454 transitions. [2022-04-27 10:31:20,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:20,558 INFO L225 Difference]: With dead ends: 488 [2022-04-27 10:31:20,558 INFO L226 Difference]: Without dead ends: 378 [2022-04-27 10:31:20,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6903, Invalid=11457, Unknown=0, NotChecked=0, Total=18360 [2022-04-27 10:31:20,562 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 883 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:20,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 46 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:31:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-04-27 10:31:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 249. [2022-04-27 10:31:20,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:20,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,800 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,800 INFO L87 Difference]: Start difference. First operand 378 states. Second operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:20,808 INFO L93 Difference]: Finished difference Result 378 states and 411 transitions. [2022-04-27 10:31:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 411 transitions. [2022-04-27 10:31:20,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:20,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:20,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 378 states. [2022-04-27 10:31:20,809 INFO L87 Difference]: Start difference. First operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 378 states. [2022-04-27 10:31:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:20,822 INFO L93 Difference]: Finished difference Result 378 states and 411 transitions. [2022-04-27 10:31:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 411 transitions. [2022-04-27 10:31:20,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:20,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:20,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:20,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.0081967213114753) internal successors, (246), 244 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2022-04-27 10:31:20,830 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 180 [2022-04-27 10:31:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:20,830 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2022-04-27 10:31:20,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2022-04-27 10:31:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-27 10:31:20,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:20,835 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:20,860 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-27 10:31:21,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:21,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1030580877, now seen corresponding path program 5 times [2022-04-27 10:31:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623203389] [2022-04-27 10:31:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:22,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {7224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7152#true} is VALID [2022-04-27 10:31:22,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {7152#true} assume true; {7152#true} is VALID [2022-04-27 10:31:22,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7152#true} {7152#true} #58#return; {7152#true} is VALID [2022-04-27 10:31:22,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {7152#true} call ULTIMATE.init(); {7224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:22,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {7224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7152#true} is VALID [2022-04-27 10:31:22,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {7152#true} assume true; {7152#true} is VALID [2022-04-27 10:31:22,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7152#true} {7152#true} #58#return; {7152#true} is VALID [2022-04-27 10:31:22,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {7152#true} call #t~ret5 := main(); {7152#true} is VALID [2022-04-27 10:31:22,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {7152#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7157#(= main_~i~0 0)} is VALID [2022-04-27 10:31:22,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {7157#(= 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; {7157#(= main_~i~0 0)} is VALID [2022-04-27 10:31:22,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {7157#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7158#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:22,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {7158#(<= 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; {7158#(<= main_~i~0 1)} is VALID [2022-04-27 10:31:22,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7159#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:22,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {7159#(<= 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; {7159#(<= main_~i~0 2)} is VALID [2022-04-27 10:31:22,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {7159#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7160#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:22,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {7160#(<= 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; {7160#(<= main_~i~0 3)} is VALID [2022-04-27 10:31:22,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {7160#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7161#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:22,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {7161#(<= 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; {7161#(<= main_~i~0 4)} is VALID [2022-04-27 10:31:22,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {7161#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7162#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:22,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {7162#(<= 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; {7162#(<= main_~i~0 5)} is VALID [2022-04-27 10:31:22,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {7162#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7163#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:22,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {7163#(<= 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; {7163#(<= main_~i~0 6)} is VALID [2022-04-27 10:31:22,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {7163#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7164#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:22,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {7164#(<= 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; {7164#(<= main_~i~0 7)} is VALID [2022-04-27 10:31:22,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {7164#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7165#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:22,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {7165#(<= 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; {7165#(<= main_~i~0 8)} is VALID [2022-04-27 10:31:22,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {7165#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7166#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:22,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {7166#(<= 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; {7166#(<= main_~i~0 9)} is VALID [2022-04-27 10:31:22,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {7166#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7167#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:22,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {7167#(<= 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; {7167#(<= main_~i~0 10)} is VALID [2022-04-27 10:31:22,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {7167#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7168#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:22,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {7168#(<= 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; {7168#(<= main_~i~0 11)} is VALID [2022-04-27 10:31:22,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {7168#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7169#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:22,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {7169#(<= 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; {7169#(<= main_~i~0 12)} is VALID [2022-04-27 10:31:22,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {7169#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7170#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:22,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {7170#(<= 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; {7170#(<= main_~i~0 13)} is VALID [2022-04-27 10:31:22,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {7170#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7171#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:22,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {7171#(<= 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; {7171#(<= main_~i~0 14)} is VALID [2022-04-27 10:31:22,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {7171#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7172#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:22,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {7172#(<= 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; {7172#(<= main_~i~0 15)} is VALID [2022-04-27 10:31:22,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {7172#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7173#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:22,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {7173#(<= 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; {7173#(<= main_~i~0 16)} is VALID [2022-04-27 10:31:22,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {7173#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7174#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:22,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {7174#(<= 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; {7174#(<= main_~i~0 17)} is VALID [2022-04-27 10:31:22,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {7174#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7175#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:22,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {7175#(<= 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; {7175#(<= main_~i~0 18)} is VALID [2022-04-27 10:31:22,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {7175#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7176#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:22,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {7176#(<= 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; {7176#(<= main_~i~0 19)} is VALID [2022-04-27 10:31:22,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {7176#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7177#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:22,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {7177#(<= 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; {7177#(<= main_~i~0 20)} is VALID [2022-04-27 10:31:22,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {7177#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7178#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:22,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {7178#(<= 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; {7178#(<= main_~i~0 21)} is VALID [2022-04-27 10:31:22,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {7178#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7179#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:22,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {7179#(<= 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; {7179#(<= main_~i~0 22)} is VALID [2022-04-27 10:31:22,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {7179#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7180#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:22,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {7180#(<= 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; {7180#(<= main_~i~0 23)} is VALID [2022-04-27 10:31:22,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {7180#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7181#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:22,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {7181#(<= 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; {7181#(<= main_~i~0 24)} is VALID [2022-04-27 10:31:22,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {7181#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7182#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:22,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {7182#(<= 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; {7182#(<= main_~i~0 25)} is VALID [2022-04-27 10:31:22,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {7182#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7183#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:22,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {7183#(<= 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; {7183#(<= main_~i~0 26)} is VALID [2022-04-27 10:31:22,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {7183#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7184#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:22,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {7184#(<= 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; {7184#(<= main_~i~0 27)} is VALID [2022-04-27 10:31:22,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {7184#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7185#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:22,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {7185#(<= 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; {7185#(<= main_~i~0 28)} is VALID [2022-04-27 10:31:22,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {7185#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7186#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:22,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {7186#(<= 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; {7186#(<= main_~i~0 29)} is VALID [2022-04-27 10:31:22,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {7186#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7187#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:22,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {7187#(<= 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; {7187#(<= main_~i~0 30)} is VALID [2022-04-27 10:31:22,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {7187#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7188#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:22,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {7188#(<= 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; {7188#(<= main_~i~0 31)} is VALID [2022-04-27 10:31:22,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {7188#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7189#(<= main_~i~0 32)} is VALID [2022-04-27 10:31:22,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {7189#(<= 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; {7189#(<= main_~i~0 32)} is VALID [2022-04-27 10:31:22,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {7189#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7190#(<= main_~i~0 33)} is VALID [2022-04-27 10:31:22,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {7190#(<= 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; {7190#(<= main_~i~0 33)} is VALID [2022-04-27 10:31:22,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {7190#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7191#(<= main_~i~0 34)} is VALID [2022-04-27 10:31:22,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {7191#(<= 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; {7191#(<= main_~i~0 34)} is VALID [2022-04-27 10:31:22,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {7191#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7192#(<= main_~i~0 35)} is VALID [2022-04-27 10:31:22,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {7192#(<= 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; {7192#(<= main_~i~0 35)} is VALID [2022-04-27 10:31:22,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {7192#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7193#(<= main_~i~0 36)} is VALID [2022-04-27 10:31:22,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {7193#(<= 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; {7193#(<= main_~i~0 36)} is VALID [2022-04-27 10:31:22,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {7193#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7194#(<= main_~i~0 37)} is VALID [2022-04-27 10:31:22,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {7194#(<= 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; {7194#(<= main_~i~0 37)} is VALID [2022-04-27 10:31:22,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {7194#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7195#(<= main_~i~0 38)} is VALID [2022-04-27 10:31:22,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {7195#(<= 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; {7195#(<= main_~i~0 38)} is VALID [2022-04-27 10:31:22,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {7195#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7196#(<= main_~i~0 39)} is VALID [2022-04-27 10:31:22,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {7196#(<= 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; {7196#(<= main_~i~0 39)} is VALID [2022-04-27 10:31:22,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {7196#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7197#(<= main_~i~0 40)} is VALID [2022-04-27 10:31:22,736 INFO L290 TraceCheckUtils]: 86: Hoare triple {7197#(<= 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; {7197#(<= main_~i~0 40)} is VALID [2022-04-27 10:31:22,736 INFO L290 TraceCheckUtils]: 87: Hoare triple {7197#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7198#(<= main_~i~0 41)} is VALID [2022-04-27 10:31:22,736 INFO L290 TraceCheckUtils]: 88: Hoare triple {7198#(<= 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; {7198#(<= main_~i~0 41)} is VALID [2022-04-27 10:31:22,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {7198#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7199#(<= main_~i~0 42)} is VALID [2022-04-27 10:31:22,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {7199#(<= 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; {7199#(<= main_~i~0 42)} is VALID [2022-04-27 10:31:22,737 INFO L290 TraceCheckUtils]: 91: Hoare triple {7199#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7200#(<= main_~i~0 43)} is VALID [2022-04-27 10:31:22,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {7200#(<= 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; {7200#(<= main_~i~0 43)} is VALID [2022-04-27 10:31:22,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {7200#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7201#(<= main_~i~0 44)} is VALID [2022-04-27 10:31:22,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {7201#(<= 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; {7201#(<= main_~i~0 44)} is VALID [2022-04-27 10:31:22,739 INFO L290 TraceCheckUtils]: 95: Hoare triple {7201#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7202#(<= main_~i~0 45)} is VALID [2022-04-27 10:31:22,739 INFO L290 TraceCheckUtils]: 96: Hoare triple {7202#(<= 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; {7202#(<= main_~i~0 45)} is VALID [2022-04-27 10:31:22,739 INFO L290 TraceCheckUtils]: 97: Hoare triple {7202#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7203#(<= main_~i~0 46)} is VALID [2022-04-27 10:31:22,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {7203#(<= 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; {7203#(<= main_~i~0 46)} is VALID [2022-04-27 10:31:22,740 INFO L290 TraceCheckUtils]: 99: Hoare triple {7203#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7204#(<= main_~i~0 47)} is VALID [2022-04-27 10:31:22,740 INFO L290 TraceCheckUtils]: 100: Hoare triple {7204#(<= 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; {7204#(<= main_~i~0 47)} is VALID [2022-04-27 10:31:22,740 INFO L290 TraceCheckUtils]: 101: Hoare triple {7204#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7205#(<= main_~i~0 48)} is VALID [2022-04-27 10:31:22,740 INFO L290 TraceCheckUtils]: 102: Hoare triple {7205#(<= 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; {7205#(<= main_~i~0 48)} is VALID [2022-04-27 10:31:22,741 INFO L290 TraceCheckUtils]: 103: Hoare triple {7205#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7206#(<= main_~i~0 49)} is VALID [2022-04-27 10:31:22,741 INFO L290 TraceCheckUtils]: 104: Hoare triple {7206#(<= 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; {7206#(<= main_~i~0 49)} is VALID [2022-04-27 10:31:22,741 INFO L290 TraceCheckUtils]: 105: Hoare triple {7206#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7207#(<= main_~i~0 50)} is VALID [2022-04-27 10:31:22,742 INFO L290 TraceCheckUtils]: 106: Hoare triple {7207#(<= 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; {7207#(<= main_~i~0 50)} is VALID [2022-04-27 10:31:22,742 INFO L290 TraceCheckUtils]: 107: Hoare triple {7207#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7208#(<= main_~i~0 51)} is VALID [2022-04-27 10:31:22,742 INFO L290 TraceCheckUtils]: 108: Hoare triple {7208#(<= 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; {7208#(<= main_~i~0 51)} is VALID [2022-04-27 10:31:22,742 INFO L290 TraceCheckUtils]: 109: Hoare triple {7208#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7209#(<= main_~i~0 52)} is VALID [2022-04-27 10:31:22,743 INFO L290 TraceCheckUtils]: 110: Hoare triple {7209#(<= 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; {7209#(<= main_~i~0 52)} is VALID [2022-04-27 10:31:22,743 INFO L290 TraceCheckUtils]: 111: Hoare triple {7209#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7210#(<= main_~i~0 53)} is VALID [2022-04-27 10:31:22,743 INFO L290 TraceCheckUtils]: 112: Hoare triple {7210#(<= 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; {7210#(<= main_~i~0 53)} is VALID [2022-04-27 10:31:22,744 INFO L290 TraceCheckUtils]: 113: Hoare triple {7210#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7211#(<= main_~i~0 54)} is VALID [2022-04-27 10:31:22,744 INFO L290 TraceCheckUtils]: 114: Hoare triple {7211#(<= 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; {7211#(<= main_~i~0 54)} is VALID [2022-04-27 10:31:22,744 INFO L290 TraceCheckUtils]: 115: Hoare triple {7211#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7212#(<= main_~i~0 55)} is VALID [2022-04-27 10:31:22,744 INFO L290 TraceCheckUtils]: 116: Hoare triple {7212#(<= 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; {7212#(<= main_~i~0 55)} is VALID [2022-04-27 10:31:22,745 INFO L290 TraceCheckUtils]: 117: Hoare triple {7212#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7213#(<= main_~i~0 56)} is VALID [2022-04-27 10:31:22,745 INFO L290 TraceCheckUtils]: 118: Hoare triple {7213#(<= 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; {7213#(<= main_~i~0 56)} is VALID [2022-04-27 10:31:22,745 INFO L290 TraceCheckUtils]: 119: Hoare triple {7213#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7214#(<= main_~i~0 57)} is VALID [2022-04-27 10:31:22,746 INFO L290 TraceCheckUtils]: 120: Hoare triple {7214#(<= 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; {7214#(<= main_~i~0 57)} is VALID [2022-04-27 10:31:22,746 INFO L290 TraceCheckUtils]: 121: Hoare triple {7214#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7215#(<= main_~i~0 58)} is VALID [2022-04-27 10:31:22,746 INFO L290 TraceCheckUtils]: 122: Hoare triple {7215#(<= 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; {7215#(<= main_~i~0 58)} is VALID [2022-04-27 10:31:22,746 INFO L290 TraceCheckUtils]: 123: Hoare triple {7215#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7216#(<= main_~i~0 59)} is VALID [2022-04-27 10:31:22,747 INFO L290 TraceCheckUtils]: 124: Hoare triple {7216#(<= 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; {7216#(<= main_~i~0 59)} is VALID [2022-04-27 10:31:22,747 INFO L290 TraceCheckUtils]: 125: Hoare triple {7216#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7217#(<= main_~i~0 60)} is VALID [2022-04-27 10:31:22,747 INFO L290 TraceCheckUtils]: 126: Hoare triple {7217#(<= 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; {7217#(<= main_~i~0 60)} is VALID [2022-04-27 10:31:22,748 INFO L290 TraceCheckUtils]: 127: Hoare triple {7217#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7218#(<= main_~i~0 61)} is VALID [2022-04-27 10:31:22,748 INFO L290 TraceCheckUtils]: 128: Hoare triple {7218#(<= 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; {7218#(<= main_~i~0 61)} is VALID [2022-04-27 10:31:22,749 INFO L290 TraceCheckUtils]: 129: Hoare triple {7218#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7219#(<= main_~i~0 62)} is VALID [2022-04-27 10:31:22,749 INFO L290 TraceCheckUtils]: 130: Hoare triple {7219#(<= 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; {7219#(<= main_~i~0 62)} is VALID [2022-04-27 10:31:22,749 INFO L290 TraceCheckUtils]: 131: Hoare triple {7219#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7220#(<= main_~i~0 63)} is VALID [2022-04-27 10:31:22,750 INFO L290 TraceCheckUtils]: 132: Hoare triple {7220#(<= 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; {7220#(<= main_~i~0 63)} is VALID [2022-04-27 10:31:22,750 INFO L290 TraceCheckUtils]: 133: Hoare triple {7220#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7221#(<= main_~i~0 64)} is VALID [2022-04-27 10:31:22,751 INFO L290 TraceCheckUtils]: 134: Hoare triple {7221#(<= 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; {7221#(<= main_~i~0 64)} is VALID [2022-04-27 10:31:22,751 INFO L290 TraceCheckUtils]: 135: Hoare triple {7221#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7222#(<= main_~i~0 65)} is VALID [2022-04-27 10:31:22,751 INFO L290 TraceCheckUtils]: 136: Hoare triple {7222#(<= 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; {7222#(<= main_~i~0 65)} is VALID [2022-04-27 10:31:22,751 INFO L290 TraceCheckUtils]: 137: Hoare triple {7222#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7223#(<= main_~i~0 66)} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 138: Hoare triple {7223#(<= main_~i~0 66)} assume !(~i~0 < 1023); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 139: Hoare triple {7153#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 140: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 141: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 142: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 143: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 144: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 145: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 146: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 147: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 148: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 149: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 150: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 151: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 152: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,752 INFO L290 TraceCheckUtils]: 153: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 154: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 155: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 156: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 157: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 158: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 159: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 160: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 161: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 162: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 163: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 164: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 165: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 166: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 167: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 168: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 169: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 170: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 171: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 172: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 173: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,753 INFO L290 TraceCheckUtils]: 174: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 175: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 176: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 177: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 178: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 179: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 180: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 181: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 182: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 183: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 184: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 185: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 186: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 187: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 188: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 189: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 190: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 191: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 192: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 193: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 194: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 195: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,754 INFO L290 TraceCheckUtils]: 196: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 197: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 198: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 199: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 200: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 201: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 202: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 203: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 204: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 205: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 206: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 207: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 208: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 209: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 210: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 211: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 212: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 213: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 214: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 215: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 216: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,755 INFO L290 TraceCheckUtils]: 217: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 218: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 219: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 220: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 221: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 222: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 223: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 224: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 225: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 226: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 227: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 228: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 229: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 230: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 231: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 232: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 233: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 234: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 235: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 236: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 237: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,756 INFO L290 TraceCheckUtils]: 238: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 239: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 240: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 241: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 242: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 243: Hoare triple {7153#false} assume !(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L272 TraceCheckUtils]: 244: Hoare triple {7153#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 245: Hoare triple {7153#false} ~cond := #in~cond; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 246: Hoare triple {7153#false} assume 0 == ~cond; {7153#false} is VALID [2022-04-27 10:31:22,757 INFO L290 TraceCheckUtils]: 247: Hoare triple {7153#false} assume !false; {7153#false} is VALID [2022-04-27 10:31:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6107 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:31:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623203389] [2022-04-27 10:31:22,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623203389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227407890] [2022-04-27 10:31:22,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:31:22,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:22,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:22,761 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-27 10:33:38,541 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2022-04-27 10:33:38,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:33:38,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 10:33:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:33:38,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:33:39,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {7152#true} call ULTIMATE.init(); {7152#true} is VALID [2022-04-27 10:33:39,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {7152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7152#true} is VALID [2022-04-27 10:33:39,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {7152#true} assume true; {7152#true} is VALID [2022-04-27 10:33:39,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7152#true} {7152#true} #58#return; {7152#true} is VALID [2022-04-27 10:33:39,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {7152#true} call #t~ret5 := main(); {7152#true} is VALID [2022-04-27 10:33:39,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {7152#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7243#(<= main_~i~0 0)} is VALID [2022-04-27 10:33:39,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {7243#(<= 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; {7243#(<= main_~i~0 0)} is VALID [2022-04-27 10:33:39,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {7243#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7158#(<= main_~i~0 1)} is VALID [2022-04-27 10:33:39,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {7158#(<= 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; {7158#(<= main_~i~0 1)} is VALID [2022-04-27 10:33:39,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {7158#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7159#(<= main_~i~0 2)} is VALID [2022-04-27 10:33:39,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {7159#(<= 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; {7159#(<= main_~i~0 2)} is VALID [2022-04-27 10:33:39,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {7159#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7160#(<= main_~i~0 3)} is VALID [2022-04-27 10:33:39,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {7160#(<= 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; {7160#(<= main_~i~0 3)} is VALID [2022-04-27 10:33:39,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {7160#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7161#(<= main_~i~0 4)} is VALID [2022-04-27 10:33:39,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {7161#(<= 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; {7161#(<= main_~i~0 4)} is VALID [2022-04-27 10:33:39,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {7161#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7162#(<= main_~i~0 5)} is VALID [2022-04-27 10:33:39,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {7162#(<= 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; {7162#(<= main_~i~0 5)} is VALID [2022-04-27 10:33:39,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {7162#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7163#(<= main_~i~0 6)} is VALID [2022-04-27 10:33:39,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {7163#(<= 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; {7163#(<= main_~i~0 6)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {7163#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7164#(<= main_~i~0 7)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {7164#(<= 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; {7164#(<= main_~i~0 7)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {7164#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7165#(<= main_~i~0 8)} is VALID [2022-04-27 10:33:39,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {7165#(<= 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; {7165#(<= main_~i~0 8)} is VALID [2022-04-27 10:33:39,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {7165#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7166#(<= main_~i~0 9)} is VALID [2022-04-27 10:33:39,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {7166#(<= 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; {7166#(<= main_~i~0 9)} is VALID [2022-04-27 10:33:39,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {7166#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7167#(<= main_~i~0 10)} is VALID [2022-04-27 10:33:39,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {7167#(<= 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; {7167#(<= main_~i~0 10)} is VALID [2022-04-27 10:33:39,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {7167#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7168#(<= main_~i~0 11)} is VALID [2022-04-27 10:33:39,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {7168#(<= 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; {7168#(<= main_~i~0 11)} is VALID [2022-04-27 10:33:39,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {7168#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7169#(<= main_~i~0 12)} is VALID [2022-04-27 10:33:39,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {7169#(<= 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; {7169#(<= main_~i~0 12)} is VALID [2022-04-27 10:33:39,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {7169#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7170#(<= main_~i~0 13)} is VALID [2022-04-27 10:33:39,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {7170#(<= 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; {7170#(<= main_~i~0 13)} is VALID [2022-04-27 10:33:39,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {7170#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7171#(<= main_~i~0 14)} is VALID [2022-04-27 10:33:39,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {7171#(<= 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; {7171#(<= main_~i~0 14)} is VALID [2022-04-27 10:33:39,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {7171#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7172#(<= main_~i~0 15)} is VALID [2022-04-27 10:33:39,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {7172#(<= 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; {7172#(<= main_~i~0 15)} is VALID [2022-04-27 10:33:39,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {7172#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7173#(<= main_~i~0 16)} is VALID [2022-04-27 10:33:39,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {7173#(<= 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; {7173#(<= main_~i~0 16)} is VALID [2022-04-27 10:33:39,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {7173#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7174#(<= main_~i~0 17)} is VALID [2022-04-27 10:33:39,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {7174#(<= 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; {7174#(<= main_~i~0 17)} is VALID [2022-04-27 10:33:39,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {7174#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7175#(<= main_~i~0 18)} is VALID [2022-04-27 10:33:39,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {7175#(<= 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; {7175#(<= main_~i~0 18)} is VALID [2022-04-27 10:33:39,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {7175#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7176#(<= main_~i~0 19)} is VALID [2022-04-27 10:33:39,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {7176#(<= 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; {7176#(<= main_~i~0 19)} is VALID [2022-04-27 10:33:39,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {7176#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7177#(<= main_~i~0 20)} is VALID [2022-04-27 10:33:39,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {7177#(<= 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; {7177#(<= main_~i~0 20)} is VALID [2022-04-27 10:33:39,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {7177#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7178#(<= main_~i~0 21)} is VALID [2022-04-27 10:33:39,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {7178#(<= 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; {7178#(<= main_~i~0 21)} is VALID [2022-04-27 10:33:39,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {7178#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7179#(<= main_~i~0 22)} is VALID [2022-04-27 10:33:39,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {7179#(<= 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; {7179#(<= main_~i~0 22)} is VALID [2022-04-27 10:33:39,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {7179#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7180#(<= main_~i~0 23)} is VALID [2022-04-27 10:33:39,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {7180#(<= 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; {7180#(<= main_~i~0 23)} is VALID [2022-04-27 10:33:39,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {7180#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7181#(<= main_~i~0 24)} is VALID [2022-04-27 10:33:39,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {7181#(<= 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; {7181#(<= main_~i~0 24)} is VALID [2022-04-27 10:33:39,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {7181#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7182#(<= main_~i~0 25)} is VALID [2022-04-27 10:33:39,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {7182#(<= 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; {7182#(<= main_~i~0 25)} is VALID [2022-04-27 10:33:39,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {7182#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7183#(<= main_~i~0 26)} is VALID [2022-04-27 10:33:39,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {7183#(<= 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; {7183#(<= main_~i~0 26)} is VALID [2022-04-27 10:33:39,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {7183#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7184#(<= main_~i~0 27)} is VALID [2022-04-27 10:33:39,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {7184#(<= 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; {7184#(<= main_~i~0 27)} is VALID [2022-04-27 10:33:39,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {7184#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7185#(<= main_~i~0 28)} is VALID [2022-04-27 10:33:39,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {7185#(<= 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; {7185#(<= main_~i~0 28)} is VALID [2022-04-27 10:33:39,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {7185#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7186#(<= main_~i~0 29)} is VALID [2022-04-27 10:33:39,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {7186#(<= 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; {7186#(<= main_~i~0 29)} is VALID [2022-04-27 10:33:39,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {7186#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7187#(<= main_~i~0 30)} is VALID [2022-04-27 10:33:39,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {7187#(<= 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; {7187#(<= main_~i~0 30)} is VALID [2022-04-27 10:33:39,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {7187#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7188#(<= main_~i~0 31)} is VALID [2022-04-27 10:33:39,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {7188#(<= 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; {7188#(<= main_~i~0 31)} is VALID [2022-04-27 10:33:39,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {7188#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7189#(<= main_~i~0 32)} is VALID [2022-04-27 10:33:39,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {7189#(<= 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; {7189#(<= main_~i~0 32)} is VALID [2022-04-27 10:33:39,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {7189#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7190#(<= main_~i~0 33)} is VALID [2022-04-27 10:33:39,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {7190#(<= 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; {7190#(<= main_~i~0 33)} is VALID [2022-04-27 10:33:39,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {7190#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7191#(<= main_~i~0 34)} is VALID [2022-04-27 10:33:39,723 INFO L290 TraceCheckUtils]: 74: Hoare triple {7191#(<= 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; {7191#(<= main_~i~0 34)} is VALID [2022-04-27 10:33:39,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {7191#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7192#(<= main_~i~0 35)} is VALID [2022-04-27 10:33:39,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {7192#(<= 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; {7192#(<= main_~i~0 35)} is VALID [2022-04-27 10:33:39,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {7192#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7193#(<= main_~i~0 36)} is VALID [2022-04-27 10:33:39,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {7193#(<= 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; {7193#(<= main_~i~0 36)} is VALID [2022-04-27 10:33:39,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {7193#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7194#(<= main_~i~0 37)} is VALID [2022-04-27 10:33:39,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {7194#(<= 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; {7194#(<= main_~i~0 37)} is VALID [2022-04-27 10:33:39,725 INFO L290 TraceCheckUtils]: 81: Hoare triple {7194#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7195#(<= main_~i~0 38)} is VALID [2022-04-27 10:33:39,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {7195#(<= 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; {7195#(<= main_~i~0 38)} is VALID [2022-04-27 10:33:39,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {7195#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7196#(<= main_~i~0 39)} is VALID [2022-04-27 10:33:39,726 INFO L290 TraceCheckUtils]: 84: Hoare triple {7196#(<= 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; {7196#(<= main_~i~0 39)} is VALID [2022-04-27 10:33:39,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {7196#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7197#(<= main_~i~0 40)} is VALID [2022-04-27 10:33:39,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {7197#(<= 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; {7197#(<= main_~i~0 40)} is VALID [2022-04-27 10:33:39,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {7197#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7198#(<= main_~i~0 41)} is VALID [2022-04-27 10:33:39,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {7198#(<= 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; {7198#(<= main_~i~0 41)} is VALID [2022-04-27 10:33:39,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {7198#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7199#(<= main_~i~0 42)} is VALID [2022-04-27 10:33:39,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {7199#(<= 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; {7199#(<= main_~i~0 42)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 91: Hoare triple {7199#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7200#(<= main_~i~0 43)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 92: Hoare triple {7200#(<= 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; {7200#(<= main_~i~0 43)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {7200#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7201#(<= main_~i~0 44)} is VALID [2022-04-27 10:33:39,728 INFO L290 TraceCheckUtils]: 94: Hoare triple {7201#(<= 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; {7201#(<= main_~i~0 44)} is VALID [2022-04-27 10:33:39,729 INFO L290 TraceCheckUtils]: 95: Hoare triple {7201#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7202#(<= main_~i~0 45)} is VALID [2022-04-27 10:33:39,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {7202#(<= 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; {7202#(<= main_~i~0 45)} is VALID [2022-04-27 10:33:39,730 INFO L290 TraceCheckUtils]: 97: Hoare triple {7202#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7203#(<= main_~i~0 46)} is VALID [2022-04-27 10:33:39,730 INFO L290 TraceCheckUtils]: 98: Hoare triple {7203#(<= 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; {7203#(<= main_~i~0 46)} is VALID [2022-04-27 10:33:39,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {7203#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7204#(<= main_~i~0 47)} is VALID [2022-04-27 10:33:39,731 INFO L290 TraceCheckUtils]: 100: Hoare triple {7204#(<= 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; {7204#(<= main_~i~0 47)} is VALID [2022-04-27 10:33:39,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {7204#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7205#(<= main_~i~0 48)} is VALID [2022-04-27 10:33:39,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {7205#(<= 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; {7205#(<= main_~i~0 48)} is VALID [2022-04-27 10:33:39,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {7205#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7206#(<= main_~i~0 49)} is VALID [2022-04-27 10:33:39,732 INFO L290 TraceCheckUtils]: 104: Hoare triple {7206#(<= 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; {7206#(<= main_~i~0 49)} is VALID [2022-04-27 10:33:39,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {7206#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7207#(<= main_~i~0 50)} is VALID [2022-04-27 10:33:39,732 INFO L290 TraceCheckUtils]: 106: Hoare triple {7207#(<= 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; {7207#(<= main_~i~0 50)} is VALID [2022-04-27 10:33:39,733 INFO L290 TraceCheckUtils]: 107: Hoare triple {7207#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7208#(<= main_~i~0 51)} is VALID [2022-04-27 10:33:39,733 INFO L290 TraceCheckUtils]: 108: Hoare triple {7208#(<= 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; {7208#(<= main_~i~0 51)} is VALID [2022-04-27 10:33:39,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {7208#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7209#(<= main_~i~0 52)} is VALID [2022-04-27 10:33:39,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {7209#(<= 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; {7209#(<= main_~i~0 52)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 111: Hoare triple {7209#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7210#(<= main_~i~0 53)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 112: Hoare triple {7210#(<= 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; {7210#(<= main_~i~0 53)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 113: Hoare triple {7210#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7211#(<= main_~i~0 54)} is VALID [2022-04-27 10:33:39,734 INFO L290 TraceCheckUtils]: 114: Hoare triple {7211#(<= 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; {7211#(<= main_~i~0 54)} is VALID [2022-04-27 10:33:39,735 INFO L290 TraceCheckUtils]: 115: Hoare triple {7211#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7212#(<= main_~i~0 55)} is VALID [2022-04-27 10:33:39,735 INFO L290 TraceCheckUtils]: 116: Hoare triple {7212#(<= 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; {7212#(<= main_~i~0 55)} is VALID [2022-04-27 10:33:39,735 INFO L290 TraceCheckUtils]: 117: Hoare triple {7212#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7213#(<= main_~i~0 56)} is VALID [2022-04-27 10:33:39,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {7213#(<= 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; {7213#(<= main_~i~0 56)} is VALID [2022-04-27 10:33:39,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {7213#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7214#(<= main_~i~0 57)} is VALID [2022-04-27 10:33:39,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {7214#(<= 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; {7214#(<= main_~i~0 57)} is VALID [2022-04-27 10:33:39,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {7214#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7215#(<= main_~i~0 58)} is VALID [2022-04-27 10:33:39,737 INFO L290 TraceCheckUtils]: 122: Hoare triple {7215#(<= 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; {7215#(<= main_~i~0 58)} is VALID [2022-04-27 10:33:39,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {7215#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7216#(<= main_~i~0 59)} is VALID [2022-04-27 10:33:39,738 INFO L290 TraceCheckUtils]: 124: Hoare triple {7216#(<= 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; {7216#(<= main_~i~0 59)} is VALID [2022-04-27 10:33:39,738 INFO L290 TraceCheckUtils]: 125: Hoare triple {7216#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7217#(<= main_~i~0 60)} is VALID [2022-04-27 10:33:39,738 INFO L290 TraceCheckUtils]: 126: Hoare triple {7217#(<= 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; {7217#(<= main_~i~0 60)} is VALID [2022-04-27 10:33:39,739 INFO L290 TraceCheckUtils]: 127: Hoare triple {7217#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7218#(<= main_~i~0 61)} is VALID [2022-04-27 10:33:39,739 INFO L290 TraceCheckUtils]: 128: Hoare triple {7218#(<= 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; {7218#(<= main_~i~0 61)} is VALID [2022-04-27 10:33:39,739 INFO L290 TraceCheckUtils]: 129: Hoare triple {7218#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7219#(<= main_~i~0 62)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 130: Hoare triple {7219#(<= 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; {7219#(<= main_~i~0 62)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 131: Hoare triple {7219#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7220#(<= main_~i~0 63)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 132: Hoare triple {7220#(<= 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; {7220#(<= main_~i~0 63)} is VALID [2022-04-27 10:33:39,740 INFO L290 TraceCheckUtils]: 133: Hoare triple {7220#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7221#(<= main_~i~0 64)} is VALID [2022-04-27 10:33:39,741 INFO L290 TraceCheckUtils]: 134: Hoare triple {7221#(<= 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; {7221#(<= main_~i~0 64)} is VALID [2022-04-27 10:33:39,741 INFO L290 TraceCheckUtils]: 135: Hoare triple {7221#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7222#(<= main_~i~0 65)} is VALID [2022-04-27 10:33:39,741 INFO L290 TraceCheckUtils]: 136: Hoare triple {7222#(<= 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; {7222#(<= main_~i~0 65)} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 137: Hoare triple {7222#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7223#(<= main_~i~0 66)} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 138: Hoare triple {7223#(<= main_~i~0 66)} assume !(~i~0 < 1023); {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 139: Hoare triple {7153#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 140: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 141: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 142: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 143: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 144: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 145: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 146: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 147: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 148: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 149: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 150: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,742 INFO L290 TraceCheckUtils]: 151: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 152: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 153: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 154: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 155: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 156: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 157: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 158: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 159: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 160: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 161: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 162: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 163: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 164: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 165: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 166: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 167: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 168: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 169: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,743 INFO L290 TraceCheckUtils]: 170: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 171: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 172: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 173: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 174: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 175: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 176: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 177: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 178: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 179: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 180: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 181: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 182: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 183: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 184: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 185: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 186: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 187: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 188: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,744 INFO L290 TraceCheckUtils]: 189: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 190: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 191: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 192: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 193: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 194: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 195: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 196: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 197: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 198: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 199: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 200: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 201: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 202: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 203: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 204: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 205: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 206: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 207: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 208: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 209: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,745 INFO L290 TraceCheckUtils]: 210: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 211: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 212: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 213: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 214: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 215: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 216: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 217: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 218: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 219: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 220: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 221: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 222: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 223: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 224: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 225: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 226: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 227: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 228: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 229: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 230: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 231: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,746 INFO L290 TraceCheckUtils]: 232: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 233: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 234: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 235: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 236: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 237: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 238: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 239: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 240: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 241: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 242: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 243: Hoare triple {7153#false} assume !(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L272 TraceCheckUtils]: 244: Hoare triple {7153#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 245: Hoare triple {7153#false} ~cond := #in~cond; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 246: Hoare triple {7153#false} assume 0 == ~cond; {7153#false} is VALID [2022-04-27 10:33:39,747 INFO L290 TraceCheckUtils]: 247: Hoare triple {7153#false} assume !false; {7153#false} is VALID [2022-04-27 10:33:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6107 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:33:39,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 247: Hoare triple {7153#false} assume !false; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 246: Hoare triple {7153#false} assume 0 == ~cond; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 245: Hoare triple {7153#false} ~cond := #in~cond; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L272 TraceCheckUtils]: 244: Hoare triple {7153#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 243: Hoare triple {7153#false} assume !(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 242: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 241: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 240: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 239: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 238: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 237: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 236: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 235: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,428 INFO L290 TraceCheckUtils]: 234: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 233: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 232: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 231: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 230: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 229: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 228: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 227: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 226: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 225: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 224: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 223: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 222: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 221: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 220: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 219: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 218: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 217: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 216: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 215: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 214: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,429 INFO L290 TraceCheckUtils]: 213: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 212: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 211: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 210: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 209: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 208: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 207: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 206: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 205: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 204: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 203: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 202: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 201: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 200: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 199: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 198: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 197: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 196: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 195: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 194: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 193: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,430 INFO L290 TraceCheckUtils]: 192: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 191: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 190: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 189: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 188: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 187: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 186: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 185: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 184: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 183: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 182: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 181: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 180: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 179: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 178: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 177: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 176: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 175: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 174: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 173: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 172: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,431 INFO L290 TraceCheckUtils]: 171: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 170: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 169: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 168: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 167: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 166: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 165: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 164: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 163: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 162: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 161: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 160: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 159: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 158: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 157: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 156: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 155: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 154: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 153: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 152: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 151: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 150: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,432 INFO L290 TraceCheckUtils]: 149: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 148: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 147: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 146: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 145: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 144: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 143: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 142: Hoare triple {7153#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 141: Hoare triple {7153#false} assume !!(0 != #t~mem4);havoc #t~mem4; {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 140: Hoare triple {7153#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {7153#false} is VALID [2022-04-27 10:33:44,433 INFO L290 TraceCheckUtils]: 139: Hoare triple {7153#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {7153#false} is VALID [2022-04-27 10:33:44,439 INFO L290 TraceCheckUtils]: 138: Hoare triple {8297#(< main_~i~0 1023)} assume !(~i~0 < 1023); {7153#false} is VALID [2022-04-27 10:33:44,440 INFO L290 TraceCheckUtils]: 137: Hoare triple {8301#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8297#(< main_~i~0 1023)} is VALID [2022-04-27 10:33:44,440 INFO L290 TraceCheckUtils]: 136: Hoare triple {8301#(< 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; {8301#(< main_~i~0 1022)} is VALID [2022-04-27 10:33:44,443 INFO L290 TraceCheckUtils]: 135: Hoare triple {8308#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8301#(< main_~i~0 1022)} is VALID [2022-04-27 10:33:44,443 INFO L290 TraceCheckUtils]: 134: Hoare triple {8308#(< 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; {8308#(< main_~i~0 1021)} is VALID [2022-04-27 10:33:44,444 INFO L290 TraceCheckUtils]: 133: Hoare triple {8315#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8308#(< main_~i~0 1021)} is VALID [2022-04-27 10:33:44,444 INFO L290 TraceCheckUtils]: 132: Hoare triple {8315#(< 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; {8315#(< main_~i~0 1020)} is VALID [2022-04-27 10:33:44,444 INFO L290 TraceCheckUtils]: 131: Hoare triple {8322#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8315#(< main_~i~0 1020)} is VALID [2022-04-27 10:33:44,451 INFO L290 TraceCheckUtils]: 130: Hoare triple {8322#(< 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; {8322#(< main_~i~0 1019)} is VALID [2022-04-27 10:33:44,455 INFO L290 TraceCheckUtils]: 129: Hoare triple {8329#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8322#(< main_~i~0 1019)} is VALID [2022-04-27 10:33:44,455 INFO L290 TraceCheckUtils]: 128: Hoare triple {8329#(< 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; {8329#(< main_~i~0 1018)} is VALID [2022-04-27 10:33:44,456 INFO L290 TraceCheckUtils]: 127: Hoare triple {8336#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8329#(< main_~i~0 1018)} is VALID [2022-04-27 10:33:44,456 INFO L290 TraceCheckUtils]: 126: Hoare triple {8336#(< 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; {8336#(< main_~i~0 1017)} is VALID [2022-04-27 10:33:44,456 INFO L290 TraceCheckUtils]: 125: Hoare triple {8343#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8336#(< main_~i~0 1017)} is VALID [2022-04-27 10:33:44,457 INFO L290 TraceCheckUtils]: 124: Hoare triple {8343#(< 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; {8343#(< main_~i~0 1016)} is VALID [2022-04-27 10:33:44,457 INFO L290 TraceCheckUtils]: 123: Hoare triple {8350#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8343#(< main_~i~0 1016)} is VALID [2022-04-27 10:33:44,457 INFO L290 TraceCheckUtils]: 122: Hoare triple {8350#(< 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; {8350#(< main_~i~0 1015)} is VALID [2022-04-27 10:33:44,457 INFO L290 TraceCheckUtils]: 121: Hoare triple {8357#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8350#(< main_~i~0 1015)} is VALID [2022-04-27 10:33:44,458 INFO L290 TraceCheckUtils]: 120: Hoare triple {8357#(< 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; {8357#(< main_~i~0 1014)} is VALID [2022-04-27 10:33:44,458 INFO L290 TraceCheckUtils]: 119: Hoare triple {8364#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8357#(< main_~i~0 1014)} is VALID [2022-04-27 10:33:44,459 INFO L290 TraceCheckUtils]: 118: Hoare triple {8364#(< 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; {8364#(< main_~i~0 1013)} is VALID [2022-04-27 10:33:44,459 INFO L290 TraceCheckUtils]: 117: Hoare triple {8371#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8364#(< main_~i~0 1013)} is VALID [2022-04-27 10:33:44,460 INFO L290 TraceCheckUtils]: 116: Hoare triple {8371#(< 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; {8371#(< main_~i~0 1012)} is VALID [2022-04-27 10:33:44,460 INFO L290 TraceCheckUtils]: 115: Hoare triple {8378#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8371#(< main_~i~0 1012)} is VALID [2022-04-27 10:33:44,460 INFO L290 TraceCheckUtils]: 114: Hoare triple {8378#(< 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; {8378#(< main_~i~0 1011)} is VALID [2022-04-27 10:33:44,461 INFO L290 TraceCheckUtils]: 113: Hoare triple {8385#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8378#(< main_~i~0 1011)} is VALID [2022-04-27 10:33:44,461 INFO L290 TraceCheckUtils]: 112: Hoare triple {8385#(< 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; {8385#(< main_~i~0 1010)} is VALID [2022-04-27 10:33:44,461 INFO L290 TraceCheckUtils]: 111: Hoare triple {8392#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8385#(< main_~i~0 1010)} is VALID [2022-04-27 10:33:44,461 INFO L290 TraceCheckUtils]: 110: Hoare triple {8392#(< 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; {8392#(< main_~i~0 1009)} is VALID [2022-04-27 10:33:44,462 INFO L290 TraceCheckUtils]: 109: Hoare triple {8399#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8392#(< main_~i~0 1009)} is VALID [2022-04-27 10:33:44,462 INFO L290 TraceCheckUtils]: 108: Hoare triple {8399#(< 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; {8399#(< main_~i~0 1008)} is VALID [2022-04-27 10:33:44,462 INFO L290 TraceCheckUtils]: 107: Hoare triple {8406#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8399#(< main_~i~0 1008)} is VALID [2022-04-27 10:33:44,463 INFO L290 TraceCheckUtils]: 106: Hoare triple {8406#(< 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; {8406#(< main_~i~0 1007)} is VALID [2022-04-27 10:33:44,463 INFO L290 TraceCheckUtils]: 105: Hoare triple {8413#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8406#(< main_~i~0 1007)} is VALID [2022-04-27 10:33:44,463 INFO L290 TraceCheckUtils]: 104: Hoare triple {8413#(< 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; {8413#(< main_~i~0 1006)} is VALID [2022-04-27 10:33:44,463 INFO L290 TraceCheckUtils]: 103: Hoare triple {8420#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8413#(< main_~i~0 1006)} is VALID [2022-04-27 10:33:44,464 INFO L290 TraceCheckUtils]: 102: Hoare triple {8420#(< 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; {8420#(< main_~i~0 1005)} is VALID [2022-04-27 10:33:44,464 INFO L290 TraceCheckUtils]: 101: Hoare triple {8427#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8420#(< main_~i~0 1005)} is VALID [2022-04-27 10:33:44,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {8427#(< 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; {8427#(< main_~i~0 1004)} is VALID [2022-04-27 10:33:44,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {8434#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8427#(< main_~i~0 1004)} is VALID [2022-04-27 10:33:44,465 INFO L290 TraceCheckUtils]: 98: Hoare triple {8434#(< 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; {8434#(< main_~i~0 1003)} is VALID [2022-04-27 10:33:44,465 INFO L290 TraceCheckUtils]: 97: Hoare triple {8441#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8434#(< main_~i~0 1003)} is VALID [2022-04-27 10:33:44,465 INFO L290 TraceCheckUtils]: 96: Hoare triple {8441#(< 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; {8441#(< main_~i~0 1002)} is VALID [2022-04-27 10:33:44,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {8448#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8441#(< main_~i~0 1002)} is VALID [2022-04-27 10:33:44,466 INFO L290 TraceCheckUtils]: 94: Hoare triple {8448#(< 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; {8448#(< main_~i~0 1001)} is VALID [2022-04-27 10:33:44,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {8455#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8448#(< main_~i~0 1001)} is VALID [2022-04-27 10:33:44,467 INFO L290 TraceCheckUtils]: 92: Hoare triple {8455#(< 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; {8455#(< main_~i~0 1000)} is VALID [2022-04-27 10:33:44,467 INFO L290 TraceCheckUtils]: 91: Hoare triple {8462#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(< main_~i~0 1000)} is VALID [2022-04-27 10:33:44,467 INFO L290 TraceCheckUtils]: 90: Hoare triple {8462#(< 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; {8462#(< main_~i~0 999)} is VALID [2022-04-27 10:33:44,467 INFO L290 TraceCheckUtils]: 89: Hoare triple {8469#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(< main_~i~0 999)} is VALID [2022-04-27 10:33:44,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {8469#(< 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; {8469#(< main_~i~0 998)} is VALID [2022-04-27 10:33:44,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {8476#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8469#(< main_~i~0 998)} is VALID [2022-04-27 10:33:44,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {8476#(< 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; {8476#(< main_~i~0 997)} is VALID [2022-04-27 10:33:44,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {8483#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8476#(< main_~i~0 997)} is VALID [2022-04-27 10:33:44,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {8483#(< 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; {8483#(< main_~i~0 996)} is VALID [2022-04-27 10:33:44,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {8490#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8483#(< main_~i~0 996)} is VALID [2022-04-27 10:33:44,469 INFO L290 TraceCheckUtils]: 82: Hoare triple {8490#(< 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; {8490#(< main_~i~0 995)} is VALID [2022-04-27 10:33:44,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {8497#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8490#(< main_~i~0 995)} is VALID [2022-04-27 10:33:44,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {8497#(< 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; {8497#(< main_~i~0 994)} is VALID [2022-04-27 10:33:44,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {8504#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8497#(< main_~i~0 994)} is VALID [2022-04-27 10:33:44,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {8504#(< 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; {8504#(< main_~i~0 993)} is VALID [2022-04-27 10:33:44,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {8511#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8504#(< main_~i~0 993)} is VALID [2022-04-27 10:33:44,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {8511#(< 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; {8511#(< main_~i~0 992)} is VALID [2022-04-27 10:33:44,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {8518#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8511#(< main_~i~0 992)} is VALID [2022-04-27 10:33:44,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {8518#(< 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; {8518#(< main_~i~0 991)} is VALID [2022-04-27 10:33:44,472 INFO L290 TraceCheckUtils]: 73: Hoare triple {8525#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8518#(< main_~i~0 991)} is VALID [2022-04-27 10:33:44,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {8525#(< 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; {8525#(< main_~i~0 990)} is VALID [2022-04-27 10:33:44,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {8532#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8525#(< main_~i~0 990)} is VALID [2022-04-27 10:33:44,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {8532#(< 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; {8532#(< main_~i~0 989)} is VALID [2022-04-27 10:33:44,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {8539#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8532#(< main_~i~0 989)} is VALID [2022-04-27 10:33:44,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {8539#(< 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; {8539#(< main_~i~0 988)} is VALID [2022-04-27 10:33:44,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {8546#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(< main_~i~0 988)} is VALID [2022-04-27 10:33:44,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {8546#(< 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; {8546#(< main_~i~0 987)} is VALID [2022-04-27 10:33:44,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {8553#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(< main_~i~0 987)} is VALID [2022-04-27 10:33:44,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {8553#(< 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; {8553#(< main_~i~0 986)} is VALID [2022-04-27 10:33:44,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {8560#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8553#(< main_~i~0 986)} is VALID [2022-04-27 10:33:44,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {8560#(< 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; {8560#(< main_~i~0 985)} is VALID [2022-04-27 10:33:44,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {8567#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8560#(< main_~i~0 985)} is VALID [2022-04-27 10:33:44,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {8567#(< 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; {8567#(< main_~i~0 984)} is VALID [2022-04-27 10:33:44,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {8574#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8567#(< main_~i~0 984)} is VALID [2022-04-27 10:33:44,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {8574#(< 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; {8574#(< main_~i~0 983)} is VALID [2022-04-27 10:33:44,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {8581#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8574#(< main_~i~0 983)} is VALID [2022-04-27 10:33:44,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {8581#(< 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; {8581#(< main_~i~0 982)} is VALID [2022-04-27 10:33:44,477 INFO L290 TraceCheckUtils]: 55: Hoare triple {8588#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8581#(< main_~i~0 982)} is VALID [2022-04-27 10:33:44,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {8588#(< 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; {8588#(< main_~i~0 981)} is VALID [2022-04-27 10:33:44,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {8595#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8588#(< main_~i~0 981)} is VALID [2022-04-27 10:33:44,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {8595#(< 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; {8595#(< main_~i~0 980)} is VALID [2022-04-27 10:33:44,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {8602#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8595#(< main_~i~0 980)} is VALID [2022-04-27 10:33:44,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {8602#(< 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; {8602#(< main_~i~0 979)} is VALID [2022-04-27 10:33:44,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {8609#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8602#(< main_~i~0 979)} is VALID [2022-04-27 10:33:44,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {8609#(< 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; {8609#(< main_~i~0 978)} is VALID [2022-04-27 10:33:44,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {8616#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8609#(< main_~i~0 978)} is VALID [2022-04-27 10:33:44,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {8616#(< 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; {8616#(< main_~i~0 977)} is VALID [2022-04-27 10:33:44,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {8623#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8616#(< main_~i~0 977)} is VALID [2022-04-27 10:33:44,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {8623#(< 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; {8623#(< main_~i~0 976)} is VALID [2022-04-27 10:33:44,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {8630#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8623#(< main_~i~0 976)} is VALID [2022-04-27 10:33:44,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {8630#(< 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; {8630#(< main_~i~0 975)} is VALID [2022-04-27 10:33:44,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {8637#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8630#(< main_~i~0 975)} is VALID [2022-04-27 10:33:44,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {8637#(< 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; {8637#(< main_~i~0 974)} is VALID [2022-04-27 10:33:44,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {8644#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8637#(< main_~i~0 974)} is VALID [2022-04-27 10:33:44,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {8644#(< 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; {8644#(< main_~i~0 973)} is VALID [2022-04-27 10:33:44,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {8651#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8644#(< main_~i~0 973)} is VALID [2022-04-27 10:33:44,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {8651#(< 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; {8651#(< main_~i~0 972)} is VALID [2022-04-27 10:33:44,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8651#(< main_~i~0 972)} is VALID [2022-04-27 10:33:44,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(< 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; {8658#(< main_~i~0 971)} is VALID [2022-04-27 10:33:44,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {8665#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8658#(< main_~i~0 971)} is VALID [2022-04-27 10:33:44,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {8665#(< 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; {8665#(< main_~i~0 970)} is VALID [2022-04-27 10:33:44,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {8672#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8665#(< main_~i~0 970)} is VALID [2022-04-27 10:33:44,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {8672#(< 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; {8672#(< main_~i~0 969)} is VALID [2022-04-27 10:33:44,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {8679#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8672#(< main_~i~0 969)} is VALID [2022-04-27 10:33:44,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {8679#(< 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; {8679#(< main_~i~0 968)} is VALID [2022-04-27 10:33:44,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {8686#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8679#(< main_~i~0 968)} is VALID [2022-04-27 10:33:44,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {8686#(< 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; {8686#(< main_~i~0 967)} is VALID [2022-04-27 10:33:44,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {8693#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8686#(< main_~i~0 967)} is VALID [2022-04-27 10:33:44,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {8693#(< 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; {8693#(< main_~i~0 966)} is VALID [2022-04-27 10:33:44,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {8700#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8693#(< main_~i~0 966)} is VALID [2022-04-27 10:33:44,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {8700#(< 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; {8700#(< main_~i~0 965)} is VALID [2022-04-27 10:33:44,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {8707#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8700#(< main_~i~0 965)} is VALID [2022-04-27 10:33:44,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {8707#(< 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; {8707#(< main_~i~0 964)} is VALID [2022-04-27 10:33:44,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {8714#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8707#(< main_~i~0 964)} is VALID [2022-04-27 10:33:44,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {8714#(< 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; {8714#(< main_~i~0 963)} is VALID [2022-04-27 10:33:44,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {8721#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8714#(< main_~i~0 963)} is VALID [2022-04-27 10:33:44,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {8721#(< 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; {8721#(< main_~i~0 962)} is VALID [2022-04-27 10:33:44,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {8728#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8721#(< main_~i~0 962)} is VALID [2022-04-27 10:33:44,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {8728#(< 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; {8728#(< main_~i~0 961)} is VALID [2022-04-27 10:33:44,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {8735#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8728#(< main_~i~0 961)} is VALID [2022-04-27 10:33:44,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {8735#(< 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; {8735#(< main_~i~0 960)} is VALID [2022-04-27 10:33:44,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {8742#(< main_~i~0 959)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8735#(< main_~i~0 960)} is VALID [2022-04-27 10:33:44,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {8742#(< 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; {8742#(< main_~i~0 959)} is VALID [2022-04-27 10:33:44,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {8749#(< main_~i~0 958)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8742#(< main_~i~0 959)} is VALID [2022-04-27 10:33:44,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {8749#(< 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; {8749#(< main_~i~0 958)} is VALID [2022-04-27 10:33:44,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {8756#(< main_~i~0 957)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8749#(< main_~i~0 958)} is VALID [2022-04-27 10:33:44,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {8756#(< 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; {8756#(< main_~i~0 957)} is VALID [2022-04-27 10:33:44,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {7152#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8756#(< main_~i~0 957)} is VALID [2022-04-27 10:33:44,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {7152#true} call #t~ret5 := main(); {7152#true} is VALID [2022-04-27 10:33:44,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7152#true} {7152#true} #58#return; {7152#true} is VALID [2022-04-27 10:33:44,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {7152#true} assume true; {7152#true} is VALID [2022-04-27 10:33:44,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {7152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7152#true} is VALID [2022-04-27 10:33:44,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {7152#true} call ULTIMATE.init(); {7152#true} is VALID [2022-04-27 10:33:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6107 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:33:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227407890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:33:44,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:33:44,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 69] total 138 [2022-04-27 10:33:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180192344] [2022-04-27 10:33:44,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:33:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 248 [2022-04-27 10:33:44,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:33:44,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:44,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:33:44,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-04-27 10:33:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:33:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-04-27 10:33:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2022-04-27 10:33:44,693 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:58,632 INFO L93 Difference]: Finished difference Result 896 states and 1065 transitions. [2022-04-27 10:33:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-04-27 10:33:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 248 [2022-04-27 10:33:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:33:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 964 transitions. [2022-04-27 10:33:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 964 transitions. [2022-04-27 10:33:58,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 964 transitions. [2022-04-27 10:33:59,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:33:59,361 INFO L225 Difference]: With dead ends: 896 [2022-04-27 10:33:59,361 INFO L226 Difference]: Without dead ends: 786 [2022-04-27 10:33:59,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11518 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=27677, Invalid=46035, Unknown=0, NotChecked=0, Total=73712 [2022-04-27 10:33:59,369 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2294 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 1017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:33:59,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 46 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1017 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 10:33:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-04-27 10:33:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 385. [2022-04-27 10:33:59,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:33:59,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 786 states. Second operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:59,703 INFO L74 IsIncluded]: Start isIncluded. First operand 786 states. Second operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:59,703 INFO L87 Difference]: Start difference. First operand 786 states. Second operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:59,726 INFO L93 Difference]: Finished difference Result 786 states and 887 transitions. [2022-04-27 10:33:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 887 transitions. [2022-04-27 10:33:59,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:33:59,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:33:59,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 786 states. [2022-04-27 10:33:59,728 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 786 states. [2022-04-27 10:33:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:59,751 INFO L93 Difference]: Finished difference Result 786 states and 887 transitions. [2022-04-27 10:33:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 887 transitions. [2022-04-27 10:33:59,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:33:59,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:33:59,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:33:59,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:33:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.0052631578947369) internal successors, (382), 380 states have internal predecessors, (382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2022-04-27 10:33:59,760 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 248 [2022-04-27 10:33:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:33:59,761 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2022-04-27 10:33:59,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 2.0434782608695654) internal successors, (282), 137 states have internal predecessors, (282), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2022-04-27 10:33:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-04-27 10:33:59,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:33:59,764 INFO L195 NwaCegarLoop]: trace histogram [134, 134, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:33:59,816 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-27 10:33:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:33:59,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:33:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:33:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1999862917, now seen corresponding path program 6 times [2022-04-27 10:33:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:33:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005662762] [2022-04-27 10:33:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:33:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:34:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:05,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:34:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:05,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {12630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12490#true} is VALID [2022-04-27 10:34:05,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {12490#true} assume true; {12490#true} is VALID [2022-04-27 10:34:05,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12490#true} {12490#true} #58#return; {12490#true} is VALID [2022-04-27 10:34:05,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {12490#true} call ULTIMATE.init(); {12630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:34:05,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {12630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {12490#true} is VALID [2022-04-27 10:34:05,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {12490#true} assume true; {12490#true} is VALID [2022-04-27 10:34:05,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12490#true} {12490#true} #58#return; {12490#true} is VALID [2022-04-27 10:34:05,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {12490#true} call #t~ret5 := main(); {12490#true} is VALID [2022-04-27 10:34:05,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {12490#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12495#(= main_~i~0 0)} is VALID [2022-04-27 10:34:05,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {12495#(= 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; {12495#(= main_~i~0 0)} is VALID [2022-04-27 10:34:05,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {12495#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12496#(<= main_~i~0 1)} is VALID [2022-04-27 10:34:05,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {12496#(<= 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; {12496#(<= main_~i~0 1)} is VALID [2022-04-27 10:34:05,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {12496#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12497#(<= main_~i~0 2)} is VALID [2022-04-27 10:34:05,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {12497#(<= 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; {12497#(<= main_~i~0 2)} is VALID [2022-04-27 10:34:05,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {12497#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12498#(<= main_~i~0 3)} is VALID [2022-04-27 10:34:05,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {12498#(<= 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; {12498#(<= main_~i~0 3)} is VALID [2022-04-27 10:34:05,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {12498#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12499#(<= main_~i~0 4)} is VALID [2022-04-27 10:34:05,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {12499#(<= 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; {12499#(<= main_~i~0 4)} is VALID [2022-04-27 10:34:05,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {12499#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12500#(<= main_~i~0 5)} is VALID [2022-04-27 10:34:05,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {12500#(<= 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; {12500#(<= main_~i~0 5)} is VALID [2022-04-27 10:34:05,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {12500#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12501#(<= main_~i~0 6)} is VALID [2022-04-27 10:34:05,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {12501#(<= 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; {12501#(<= main_~i~0 6)} is VALID [2022-04-27 10:34:05,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {12501#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12502#(<= main_~i~0 7)} is VALID [2022-04-27 10:34:05,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {12502#(<= 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; {12502#(<= main_~i~0 7)} is VALID [2022-04-27 10:34:05,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {12502#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12503#(<= main_~i~0 8)} is VALID [2022-04-27 10:34:05,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {12503#(<= 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; {12503#(<= main_~i~0 8)} is VALID [2022-04-27 10:34:05,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {12503#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12504#(<= main_~i~0 9)} is VALID [2022-04-27 10:34:05,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {12504#(<= 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; {12504#(<= main_~i~0 9)} is VALID [2022-04-27 10:34:05,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {12504#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12505#(<= main_~i~0 10)} is VALID [2022-04-27 10:34:05,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {12505#(<= 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; {12505#(<= main_~i~0 10)} is VALID [2022-04-27 10:34:05,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {12505#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12506#(<= main_~i~0 11)} is VALID [2022-04-27 10:34:05,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {12506#(<= 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; {12506#(<= main_~i~0 11)} is VALID [2022-04-27 10:34:05,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {12506#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12507#(<= main_~i~0 12)} is VALID [2022-04-27 10:34:05,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {12507#(<= 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; {12507#(<= main_~i~0 12)} is VALID [2022-04-27 10:34:05,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {12507#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12508#(<= main_~i~0 13)} is VALID [2022-04-27 10:34:05,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {12508#(<= 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; {12508#(<= main_~i~0 13)} is VALID [2022-04-27 10:34:05,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {12508#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12509#(<= main_~i~0 14)} is VALID [2022-04-27 10:34:05,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {12509#(<= 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; {12509#(<= main_~i~0 14)} is VALID [2022-04-27 10:34:05,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {12509#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12510#(<= main_~i~0 15)} is VALID [2022-04-27 10:34:05,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {12510#(<= 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; {12510#(<= main_~i~0 15)} is VALID [2022-04-27 10:34:05,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {12510#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#(<= main_~i~0 16)} is VALID [2022-04-27 10:34:05,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {12511#(<= 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; {12511#(<= main_~i~0 16)} is VALID [2022-04-27 10:34:05,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {12511#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12512#(<= main_~i~0 17)} is VALID [2022-04-27 10:34:05,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {12512#(<= 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; {12512#(<= main_~i~0 17)} is VALID [2022-04-27 10:34:05,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {12512#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12513#(<= main_~i~0 18)} is VALID [2022-04-27 10:34:05,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {12513#(<= 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; {12513#(<= main_~i~0 18)} is VALID [2022-04-27 10:34:05,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {12513#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12514#(<= main_~i~0 19)} is VALID [2022-04-27 10:34:05,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {12514#(<= 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; {12514#(<= main_~i~0 19)} is VALID [2022-04-27 10:34:05,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {12514#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12515#(<= main_~i~0 20)} is VALID [2022-04-27 10:34:05,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {12515#(<= 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; {12515#(<= main_~i~0 20)} is VALID [2022-04-27 10:34:05,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {12515#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12516#(<= main_~i~0 21)} is VALID [2022-04-27 10:34:05,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {12516#(<= 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; {12516#(<= main_~i~0 21)} is VALID [2022-04-27 10:34:05,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {12516#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12517#(<= main_~i~0 22)} is VALID [2022-04-27 10:34:05,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {12517#(<= 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; {12517#(<= main_~i~0 22)} is VALID [2022-04-27 10:34:05,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {12517#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12518#(<= main_~i~0 23)} is VALID [2022-04-27 10:34:05,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {12518#(<= 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; {12518#(<= main_~i~0 23)} is VALID [2022-04-27 10:34:05,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {12518#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12519#(<= main_~i~0 24)} is VALID [2022-04-27 10:34:05,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {12519#(<= 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; {12519#(<= main_~i~0 24)} is VALID [2022-04-27 10:34:05,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {12519#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12520#(<= main_~i~0 25)} is VALID [2022-04-27 10:34:05,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {12520#(<= 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; {12520#(<= main_~i~0 25)} is VALID [2022-04-27 10:34:05,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {12520#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12521#(<= main_~i~0 26)} is VALID [2022-04-27 10:34:05,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {12521#(<= 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; {12521#(<= main_~i~0 26)} is VALID [2022-04-27 10:34:05,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {12521#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12522#(<= main_~i~0 27)} is VALID [2022-04-27 10:34:05,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {12522#(<= 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; {12522#(<= main_~i~0 27)} is VALID [2022-04-27 10:34:05,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {12522#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12523#(<= main_~i~0 28)} is VALID [2022-04-27 10:34:05,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {12523#(<= 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; {12523#(<= main_~i~0 28)} is VALID [2022-04-27 10:34:05,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {12523#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12524#(<= main_~i~0 29)} is VALID [2022-04-27 10:34:05,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {12524#(<= 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; {12524#(<= main_~i~0 29)} is VALID [2022-04-27 10:34:05,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {12524#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12525#(<= main_~i~0 30)} is VALID [2022-04-27 10:34:05,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {12525#(<= 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; {12525#(<= main_~i~0 30)} is VALID [2022-04-27 10:34:05,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {12525#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12526#(<= main_~i~0 31)} is VALID [2022-04-27 10:34:05,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {12526#(<= 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; {12526#(<= main_~i~0 31)} is VALID [2022-04-27 10:34:05,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {12526#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12527#(<= main_~i~0 32)} is VALID [2022-04-27 10:34:05,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {12527#(<= 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; {12527#(<= main_~i~0 32)} is VALID [2022-04-27 10:34:05,588 INFO L290 TraceCheckUtils]: 71: Hoare triple {12527#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12528#(<= main_~i~0 33)} is VALID [2022-04-27 10:34:05,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {12528#(<= 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; {12528#(<= main_~i~0 33)} is VALID [2022-04-27 10:34:05,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {12528#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12529#(<= main_~i~0 34)} is VALID [2022-04-27 10:34:05,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {12529#(<= 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; {12529#(<= main_~i~0 34)} is VALID [2022-04-27 10:34:05,589 INFO L290 TraceCheckUtils]: 75: Hoare triple {12529#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12530#(<= main_~i~0 35)} is VALID [2022-04-27 10:34:05,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {12530#(<= 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; {12530#(<= main_~i~0 35)} is VALID [2022-04-27 10:34:05,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {12530#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12531#(<= main_~i~0 36)} is VALID [2022-04-27 10:34:05,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {12531#(<= 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; {12531#(<= main_~i~0 36)} is VALID [2022-04-27 10:34:05,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {12531#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12532#(<= main_~i~0 37)} is VALID [2022-04-27 10:34:05,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {12532#(<= 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; {12532#(<= main_~i~0 37)} is VALID [2022-04-27 10:34:05,591 INFO L290 TraceCheckUtils]: 81: Hoare triple {12532#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12533#(<= main_~i~0 38)} is VALID [2022-04-27 10:34:05,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {12533#(<= 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; {12533#(<= main_~i~0 38)} is VALID [2022-04-27 10:34:05,592 INFO L290 TraceCheckUtils]: 83: Hoare triple {12533#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12534#(<= main_~i~0 39)} is VALID [2022-04-27 10:34:05,592 INFO L290 TraceCheckUtils]: 84: Hoare triple {12534#(<= 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; {12534#(<= main_~i~0 39)} is VALID [2022-04-27 10:34:05,592 INFO L290 TraceCheckUtils]: 85: Hoare triple {12534#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12535#(<= main_~i~0 40)} is VALID [2022-04-27 10:34:05,592 INFO L290 TraceCheckUtils]: 86: Hoare triple {12535#(<= 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; {12535#(<= main_~i~0 40)} is VALID [2022-04-27 10:34:05,593 INFO L290 TraceCheckUtils]: 87: Hoare triple {12535#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12536#(<= main_~i~0 41)} is VALID [2022-04-27 10:34:05,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {12536#(<= 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; {12536#(<= main_~i~0 41)} is VALID [2022-04-27 10:34:05,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {12536#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12537#(<= main_~i~0 42)} is VALID [2022-04-27 10:34:05,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {12537#(<= 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; {12537#(<= main_~i~0 42)} is VALID [2022-04-27 10:34:05,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {12537#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12538#(<= main_~i~0 43)} is VALID [2022-04-27 10:34:05,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {12538#(<= 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; {12538#(<= main_~i~0 43)} is VALID [2022-04-27 10:34:05,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {12538#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12539#(<= main_~i~0 44)} is VALID [2022-04-27 10:34:05,595 INFO L290 TraceCheckUtils]: 94: Hoare triple {12539#(<= 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; {12539#(<= main_~i~0 44)} is VALID [2022-04-27 10:34:05,595 INFO L290 TraceCheckUtils]: 95: Hoare triple {12539#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12540#(<= main_~i~0 45)} is VALID [2022-04-27 10:34:05,595 INFO L290 TraceCheckUtils]: 96: Hoare triple {12540#(<= 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; {12540#(<= main_~i~0 45)} is VALID [2022-04-27 10:34:05,595 INFO L290 TraceCheckUtils]: 97: Hoare triple {12540#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12541#(<= main_~i~0 46)} is VALID [2022-04-27 10:34:05,596 INFO L290 TraceCheckUtils]: 98: Hoare triple {12541#(<= 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; {12541#(<= main_~i~0 46)} is VALID [2022-04-27 10:34:05,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {12541#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12542#(<= main_~i~0 47)} is VALID [2022-04-27 10:34:05,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {12542#(<= 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; {12542#(<= main_~i~0 47)} is VALID [2022-04-27 10:34:05,596 INFO L290 TraceCheckUtils]: 101: Hoare triple {12542#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12543#(<= main_~i~0 48)} is VALID [2022-04-27 10:34:05,597 INFO L290 TraceCheckUtils]: 102: Hoare triple {12543#(<= 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; {12543#(<= main_~i~0 48)} is VALID [2022-04-27 10:34:05,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {12543#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12544#(<= main_~i~0 49)} is VALID [2022-04-27 10:34:05,597 INFO L290 TraceCheckUtils]: 104: Hoare triple {12544#(<= 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; {12544#(<= main_~i~0 49)} is VALID [2022-04-27 10:34:05,598 INFO L290 TraceCheckUtils]: 105: Hoare triple {12544#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12545#(<= main_~i~0 50)} is VALID [2022-04-27 10:34:05,598 INFO L290 TraceCheckUtils]: 106: Hoare triple {12545#(<= 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; {12545#(<= main_~i~0 50)} is VALID [2022-04-27 10:34:05,598 INFO L290 TraceCheckUtils]: 107: Hoare triple {12545#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12546#(<= main_~i~0 51)} is VALID [2022-04-27 10:34:05,598 INFO L290 TraceCheckUtils]: 108: Hoare triple {12546#(<= 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; {12546#(<= main_~i~0 51)} is VALID [2022-04-27 10:34:05,599 INFO L290 TraceCheckUtils]: 109: Hoare triple {12546#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12547#(<= main_~i~0 52)} is VALID [2022-04-27 10:34:05,599 INFO L290 TraceCheckUtils]: 110: Hoare triple {12547#(<= 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; {12547#(<= main_~i~0 52)} is VALID [2022-04-27 10:34:05,599 INFO L290 TraceCheckUtils]: 111: Hoare triple {12547#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12548#(<= main_~i~0 53)} is VALID [2022-04-27 10:34:05,599 INFO L290 TraceCheckUtils]: 112: Hoare triple {12548#(<= 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; {12548#(<= main_~i~0 53)} is VALID [2022-04-27 10:34:05,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {12548#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12549#(<= main_~i~0 54)} is VALID [2022-04-27 10:34:05,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {12549#(<= 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; {12549#(<= main_~i~0 54)} is VALID [2022-04-27 10:34:05,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {12549#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12550#(<= main_~i~0 55)} is VALID [2022-04-27 10:34:05,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {12550#(<= 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; {12550#(<= main_~i~0 55)} is VALID [2022-04-27 10:34:05,601 INFO L290 TraceCheckUtils]: 117: Hoare triple {12550#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12551#(<= main_~i~0 56)} is VALID [2022-04-27 10:34:05,601 INFO L290 TraceCheckUtils]: 118: Hoare triple {12551#(<= 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; {12551#(<= main_~i~0 56)} is VALID [2022-04-27 10:34:05,601 INFO L290 TraceCheckUtils]: 119: Hoare triple {12551#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12552#(<= main_~i~0 57)} is VALID [2022-04-27 10:34:05,602 INFO L290 TraceCheckUtils]: 120: Hoare triple {12552#(<= 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; {12552#(<= main_~i~0 57)} is VALID [2022-04-27 10:34:05,602 INFO L290 TraceCheckUtils]: 121: Hoare triple {12552#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12553#(<= main_~i~0 58)} is VALID [2022-04-27 10:34:05,602 INFO L290 TraceCheckUtils]: 122: Hoare triple {12553#(<= 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; {12553#(<= main_~i~0 58)} is VALID [2022-04-27 10:34:05,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {12553#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12554#(<= main_~i~0 59)} is VALID [2022-04-27 10:34:05,603 INFO L290 TraceCheckUtils]: 124: Hoare triple {12554#(<= 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; {12554#(<= main_~i~0 59)} is VALID [2022-04-27 10:34:05,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {12554#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12555#(<= main_~i~0 60)} is VALID [2022-04-27 10:34:05,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {12555#(<= 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; {12555#(<= main_~i~0 60)} is VALID [2022-04-27 10:34:05,604 INFO L290 TraceCheckUtils]: 127: Hoare triple {12555#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12556#(<= main_~i~0 61)} is VALID [2022-04-27 10:34:05,604 INFO L290 TraceCheckUtils]: 128: Hoare triple {12556#(<= 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; {12556#(<= main_~i~0 61)} is VALID [2022-04-27 10:34:05,604 INFO L290 TraceCheckUtils]: 129: Hoare triple {12556#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12557#(<= main_~i~0 62)} is VALID [2022-04-27 10:34:05,604 INFO L290 TraceCheckUtils]: 130: Hoare triple {12557#(<= 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; {12557#(<= main_~i~0 62)} is VALID [2022-04-27 10:34:05,605 INFO L290 TraceCheckUtils]: 131: Hoare triple {12557#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12558#(<= main_~i~0 63)} is VALID [2022-04-27 10:34:05,605 INFO L290 TraceCheckUtils]: 132: Hoare triple {12558#(<= 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; {12558#(<= main_~i~0 63)} is VALID [2022-04-27 10:34:05,605 INFO L290 TraceCheckUtils]: 133: Hoare triple {12558#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12559#(<= main_~i~0 64)} is VALID [2022-04-27 10:34:05,605 INFO L290 TraceCheckUtils]: 134: Hoare triple {12559#(<= 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; {12559#(<= main_~i~0 64)} is VALID [2022-04-27 10:34:05,606 INFO L290 TraceCheckUtils]: 135: Hoare triple {12559#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12560#(<= main_~i~0 65)} is VALID [2022-04-27 10:34:05,606 INFO L290 TraceCheckUtils]: 136: Hoare triple {12560#(<= 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; {12560#(<= main_~i~0 65)} is VALID [2022-04-27 10:34:05,606 INFO L290 TraceCheckUtils]: 137: Hoare triple {12560#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12561#(<= main_~i~0 66)} is VALID [2022-04-27 10:34:05,606 INFO L290 TraceCheckUtils]: 138: Hoare triple {12561#(<= 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; {12561#(<= main_~i~0 66)} is VALID [2022-04-27 10:34:05,607 INFO L290 TraceCheckUtils]: 139: Hoare triple {12561#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12562#(<= main_~i~0 67)} is VALID [2022-04-27 10:34:05,607 INFO L290 TraceCheckUtils]: 140: Hoare triple {12562#(<= 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; {12562#(<= main_~i~0 67)} is VALID [2022-04-27 10:34:05,607 INFO L290 TraceCheckUtils]: 141: Hoare triple {12562#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12563#(<= main_~i~0 68)} is VALID [2022-04-27 10:34:05,608 INFO L290 TraceCheckUtils]: 142: Hoare triple {12563#(<= 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; {12563#(<= main_~i~0 68)} is VALID [2022-04-27 10:34:05,608 INFO L290 TraceCheckUtils]: 143: Hoare triple {12563#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12564#(<= main_~i~0 69)} is VALID [2022-04-27 10:34:05,608 INFO L290 TraceCheckUtils]: 144: Hoare triple {12564#(<= main_~i~0 69)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12564#(<= main_~i~0 69)} is VALID [2022-04-27 10:34:05,608 INFO L290 TraceCheckUtils]: 145: Hoare triple {12564#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12565#(<= main_~i~0 70)} is VALID [2022-04-27 10:34:05,609 INFO L290 TraceCheckUtils]: 146: Hoare triple {12565#(<= main_~i~0 70)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12565#(<= main_~i~0 70)} is VALID [2022-04-27 10:34:05,609 INFO L290 TraceCheckUtils]: 147: Hoare triple {12565#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12566#(<= main_~i~0 71)} is VALID [2022-04-27 10:34:05,609 INFO L290 TraceCheckUtils]: 148: Hoare triple {12566#(<= main_~i~0 71)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12566#(<= main_~i~0 71)} is VALID [2022-04-27 10:34:05,610 INFO L290 TraceCheckUtils]: 149: Hoare triple {12566#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12567#(<= main_~i~0 72)} is VALID [2022-04-27 10:34:05,610 INFO L290 TraceCheckUtils]: 150: Hoare triple {12567#(<= main_~i~0 72)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12567#(<= main_~i~0 72)} is VALID [2022-04-27 10:34:05,610 INFO L290 TraceCheckUtils]: 151: Hoare triple {12567#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12568#(<= main_~i~0 73)} is VALID [2022-04-27 10:34:05,610 INFO L290 TraceCheckUtils]: 152: Hoare triple {12568#(<= main_~i~0 73)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12568#(<= main_~i~0 73)} is VALID [2022-04-27 10:34:05,611 INFO L290 TraceCheckUtils]: 153: Hoare triple {12568#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12569#(<= main_~i~0 74)} is VALID [2022-04-27 10:34:05,611 INFO L290 TraceCheckUtils]: 154: Hoare triple {12569#(<= main_~i~0 74)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12569#(<= main_~i~0 74)} is VALID [2022-04-27 10:34:05,611 INFO L290 TraceCheckUtils]: 155: Hoare triple {12569#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12570#(<= main_~i~0 75)} is VALID [2022-04-27 10:34:05,611 INFO L290 TraceCheckUtils]: 156: Hoare triple {12570#(<= main_~i~0 75)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12570#(<= main_~i~0 75)} is VALID [2022-04-27 10:34:05,612 INFO L290 TraceCheckUtils]: 157: Hoare triple {12570#(<= main_~i~0 75)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12571#(<= main_~i~0 76)} is VALID [2022-04-27 10:34:05,612 INFO L290 TraceCheckUtils]: 158: Hoare triple {12571#(<= main_~i~0 76)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12571#(<= main_~i~0 76)} is VALID [2022-04-27 10:34:05,613 INFO L290 TraceCheckUtils]: 159: Hoare triple {12571#(<= main_~i~0 76)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12572#(<= main_~i~0 77)} is VALID [2022-04-27 10:34:05,613 INFO L290 TraceCheckUtils]: 160: Hoare triple {12572#(<= main_~i~0 77)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12572#(<= main_~i~0 77)} is VALID [2022-04-27 10:34:05,614 INFO L290 TraceCheckUtils]: 161: Hoare triple {12572#(<= main_~i~0 77)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12573#(<= main_~i~0 78)} is VALID [2022-04-27 10:34:05,614 INFO L290 TraceCheckUtils]: 162: Hoare triple {12573#(<= main_~i~0 78)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12573#(<= main_~i~0 78)} is VALID [2022-04-27 10:34:05,614 INFO L290 TraceCheckUtils]: 163: Hoare triple {12573#(<= main_~i~0 78)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12574#(<= main_~i~0 79)} is VALID [2022-04-27 10:34:05,615 INFO L290 TraceCheckUtils]: 164: Hoare triple {12574#(<= main_~i~0 79)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12574#(<= main_~i~0 79)} is VALID [2022-04-27 10:34:05,615 INFO L290 TraceCheckUtils]: 165: Hoare triple {12574#(<= main_~i~0 79)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12575#(<= main_~i~0 80)} is VALID [2022-04-27 10:34:05,615 INFO L290 TraceCheckUtils]: 166: Hoare triple {12575#(<= main_~i~0 80)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12575#(<= main_~i~0 80)} is VALID [2022-04-27 10:34:05,615 INFO L290 TraceCheckUtils]: 167: Hoare triple {12575#(<= main_~i~0 80)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12576#(<= main_~i~0 81)} is VALID [2022-04-27 10:34:05,617 INFO L290 TraceCheckUtils]: 168: Hoare triple {12576#(<= main_~i~0 81)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12576#(<= main_~i~0 81)} is VALID [2022-04-27 10:34:05,617 INFO L290 TraceCheckUtils]: 169: Hoare triple {12576#(<= main_~i~0 81)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12577#(<= main_~i~0 82)} is VALID [2022-04-27 10:34:05,617 INFO L290 TraceCheckUtils]: 170: Hoare triple {12577#(<= main_~i~0 82)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12577#(<= main_~i~0 82)} is VALID [2022-04-27 10:34:05,617 INFO L290 TraceCheckUtils]: 171: Hoare triple {12577#(<= main_~i~0 82)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12578#(<= main_~i~0 83)} is VALID [2022-04-27 10:34:05,618 INFO L290 TraceCheckUtils]: 172: Hoare triple {12578#(<= main_~i~0 83)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12578#(<= main_~i~0 83)} is VALID [2022-04-27 10:34:05,618 INFO L290 TraceCheckUtils]: 173: Hoare triple {12578#(<= main_~i~0 83)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12579#(<= main_~i~0 84)} is VALID [2022-04-27 10:34:05,618 INFO L290 TraceCheckUtils]: 174: Hoare triple {12579#(<= main_~i~0 84)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12579#(<= main_~i~0 84)} is VALID [2022-04-27 10:34:05,619 INFO L290 TraceCheckUtils]: 175: Hoare triple {12579#(<= main_~i~0 84)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12580#(<= main_~i~0 85)} is VALID [2022-04-27 10:34:05,619 INFO L290 TraceCheckUtils]: 176: Hoare triple {12580#(<= main_~i~0 85)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12580#(<= main_~i~0 85)} is VALID [2022-04-27 10:34:05,619 INFO L290 TraceCheckUtils]: 177: Hoare triple {12580#(<= main_~i~0 85)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12581#(<= main_~i~0 86)} is VALID [2022-04-27 10:34:05,619 INFO L290 TraceCheckUtils]: 178: Hoare triple {12581#(<= main_~i~0 86)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12581#(<= main_~i~0 86)} is VALID [2022-04-27 10:34:05,620 INFO L290 TraceCheckUtils]: 179: Hoare triple {12581#(<= main_~i~0 86)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12582#(<= main_~i~0 87)} is VALID [2022-04-27 10:34:05,620 INFO L290 TraceCheckUtils]: 180: Hoare triple {12582#(<= main_~i~0 87)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12582#(<= main_~i~0 87)} is VALID [2022-04-27 10:34:05,620 INFO L290 TraceCheckUtils]: 181: Hoare triple {12582#(<= main_~i~0 87)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12583#(<= main_~i~0 88)} is VALID [2022-04-27 10:34:05,620 INFO L290 TraceCheckUtils]: 182: Hoare triple {12583#(<= main_~i~0 88)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12583#(<= main_~i~0 88)} is VALID [2022-04-27 10:34:05,621 INFO L290 TraceCheckUtils]: 183: Hoare triple {12583#(<= main_~i~0 88)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12584#(<= main_~i~0 89)} is VALID [2022-04-27 10:34:05,621 INFO L290 TraceCheckUtils]: 184: Hoare triple {12584#(<= main_~i~0 89)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12584#(<= main_~i~0 89)} is VALID [2022-04-27 10:34:05,621 INFO L290 TraceCheckUtils]: 185: Hoare triple {12584#(<= main_~i~0 89)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12585#(<= main_~i~0 90)} is VALID [2022-04-27 10:34:05,622 INFO L290 TraceCheckUtils]: 186: Hoare triple {12585#(<= main_~i~0 90)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12585#(<= main_~i~0 90)} is VALID [2022-04-27 10:34:05,622 INFO L290 TraceCheckUtils]: 187: Hoare triple {12585#(<= main_~i~0 90)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12586#(<= main_~i~0 91)} is VALID [2022-04-27 10:34:05,622 INFO L290 TraceCheckUtils]: 188: Hoare triple {12586#(<= main_~i~0 91)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12586#(<= main_~i~0 91)} is VALID [2022-04-27 10:34:05,622 INFO L290 TraceCheckUtils]: 189: Hoare triple {12586#(<= main_~i~0 91)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12587#(<= main_~i~0 92)} is VALID [2022-04-27 10:34:05,623 INFO L290 TraceCheckUtils]: 190: Hoare triple {12587#(<= main_~i~0 92)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12587#(<= main_~i~0 92)} is VALID [2022-04-27 10:34:05,623 INFO L290 TraceCheckUtils]: 191: Hoare triple {12587#(<= main_~i~0 92)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12588#(<= main_~i~0 93)} is VALID [2022-04-27 10:34:05,623 INFO L290 TraceCheckUtils]: 192: Hoare triple {12588#(<= main_~i~0 93)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12588#(<= main_~i~0 93)} is VALID [2022-04-27 10:34:05,624 INFO L290 TraceCheckUtils]: 193: Hoare triple {12588#(<= main_~i~0 93)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12589#(<= main_~i~0 94)} is VALID [2022-04-27 10:34:05,624 INFO L290 TraceCheckUtils]: 194: Hoare triple {12589#(<= main_~i~0 94)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12589#(<= main_~i~0 94)} is VALID [2022-04-27 10:34:05,624 INFO L290 TraceCheckUtils]: 195: Hoare triple {12589#(<= main_~i~0 94)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12590#(<= main_~i~0 95)} is VALID [2022-04-27 10:34:05,624 INFO L290 TraceCheckUtils]: 196: Hoare triple {12590#(<= main_~i~0 95)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12590#(<= main_~i~0 95)} is VALID [2022-04-27 10:34:05,625 INFO L290 TraceCheckUtils]: 197: Hoare triple {12590#(<= main_~i~0 95)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12591#(<= main_~i~0 96)} is VALID [2022-04-27 10:34:05,625 INFO L290 TraceCheckUtils]: 198: Hoare triple {12591#(<= main_~i~0 96)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12591#(<= main_~i~0 96)} is VALID [2022-04-27 10:34:05,625 INFO L290 TraceCheckUtils]: 199: Hoare triple {12591#(<= main_~i~0 96)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12592#(<= main_~i~0 97)} is VALID [2022-04-27 10:34:05,625 INFO L290 TraceCheckUtils]: 200: Hoare triple {12592#(<= main_~i~0 97)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12592#(<= main_~i~0 97)} is VALID [2022-04-27 10:34:05,626 INFO L290 TraceCheckUtils]: 201: Hoare triple {12592#(<= main_~i~0 97)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12593#(<= main_~i~0 98)} is VALID [2022-04-27 10:34:05,626 INFO L290 TraceCheckUtils]: 202: Hoare triple {12593#(<= main_~i~0 98)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12593#(<= main_~i~0 98)} is VALID [2022-04-27 10:34:05,626 INFO L290 TraceCheckUtils]: 203: Hoare triple {12593#(<= main_~i~0 98)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12594#(<= main_~i~0 99)} is VALID [2022-04-27 10:34:05,626 INFO L290 TraceCheckUtils]: 204: Hoare triple {12594#(<= main_~i~0 99)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12594#(<= main_~i~0 99)} is VALID [2022-04-27 10:34:05,627 INFO L290 TraceCheckUtils]: 205: Hoare triple {12594#(<= main_~i~0 99)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12595#(<= main_~i~0 100)} is VALID [2022-04-27 10:34:05,627 INFO L290 TraceCheckUtils]: 206: Hoare triple {12595#(<= main_~i~0 100)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12595#(<= main_~i~0 100)} is VALID [2022-04-27 10:34:05,627 INFO L290 TraceCheckUtils]: 207: Hoare triple {12595#(<= main_~i~0 100)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12596#(<= main_~i~0 101)} is VALID [2022-04-27 10:34:05,628 INFO L290 TraceCheckUtils]: 208: Hoare triple {12596#(<= main_~i~0 101)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12596#(<= main_~i~0 101)} is VALID [2022-04-27 10:34:05,628 INFO L290 TraceCheckUtils]: 209: Hoare triple {12596#(<= main_~i~0 101)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12597#(<= main_~i~0 102)} is VALID [2022-04-27 10:34:05,628 INFO L290 TraceCheckUtils]: 210: Hoare triple {12597#(<= main_~i~0 102)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12597#(<= main_~i~0 102)} is VALID [2022-04-27 10:34:05,628 INFO L290 TraceCheckUtils]: 211: Hoare triple {12597#(<= main_~i~0 102)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12598#(<= main_~i~0 103)} is VALID [2022-04-27 10:34:05,629 INFO L290 TraceCheckUtils]: 212: Hoare triple {12598#(<= main_~i~0 103)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12598#(<= main_~i~0 103)} is VALID [2022-04-27 10:34:05,629 INFO L290 TraceCheckUtils]: 213: Hoare triple {12598#(<= main_~i~0 103)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12599#(<= main_~i~0 104)} is VALID [2022-04-27 10:34:05,629 INFO L290 TraceCheckUtils]: 214: Hoare triple {12599#(<= main_~i~0 104)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12599#(<= main_~i~0 104)} is VALID [2022-04-27 10:34:05,630 INFO L290 TraceCheckUtils]: 215: Hoare triple {12599#(<= main_~i~0 104)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12600#(<= main_~i~0 105)} is VALID [2022-04-27 10:34:05,630 INFO L290 TraceCheckUtils]: 216: Hoare triple {12600#(<= main_~i~0 105)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12600#(<= main_~i~0 105)} is VALID [2022-04-27 10:34:05,630 INFO L290 TraceCheckUtils]: 217: Hoare triple {12600#(<= main_~i~0 105)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12601#(<= main_~i~0 106)} is VALID [2022-04-27 10:34:05,630 INFO L290 TraceCheckUtils]: 218: Hoare triple {12601#(<= main_~i~0 106)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12601#(<= main_~i~0 106)} is VALID [2022-04-27 10:34:05,631 INFO L290 TraceCheckUtils]: 219: Hoare triple {12601#(<= main_~i~0 106)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12602#(<= main_~i~0 107)} is VALID [2022-04-27 10:34:05,631 INFO L290 TraceCheckUtils]: 220: Hoare triple {12602#(<= main_~i~0 107)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12602#(<= main_~i~0 107)} is VALID [2022-04-27 10:34:05,631 INFO L290 TraceCheckUtils]: 221: Hoare triple {12602#(<= main_~i~0 107)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12603#(<= main_~i~0 108)} is VALID [2022-04-27 10:34:05,631 INFO L290 TraceCheckUtils]: 222: Hoare triple {12603#(<= main_~i~0 108)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12603#(<= main_~i~0 108)} is VALID [2022-04-27 10:34:05,632 INFO L290 TraceCheckUtils]: 223: Hoare triple {12603#(<= main_~i~0 108)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12604#(<= main_~i~0 109)} is VALID [2022-04-27 10:34:05,632 INFO L290 TraceCheckUtils]: 224: Hoare triple {12604#(<= main_~i~0 109)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12604#(<= main_~i~0 109)} is VALID [2022-04-27 10:34:05,632 INFO L290 TraceCheckUtils]: 225: Hoare triple {12604#(<= main_~i~0 109)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12605#(<= main_~i~0 110)} is VALID [2022-04-27 10:34:05,632 INFO L290 TraceCheckUtils]: 226: Hoare triple {12605#(<= main_~i~0 110)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12605#(<= main_~i~0 110)} is VALID [2022-04-27 10:34:05,633 INFO L290 TraceCheckUtils]: 227: Hoare triple {12605#(<= main_~i~0 110)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12606#(<= main_~i~0 111)} is VALID [2022-04-27 10:34:05,633 INFO L290 TraceCheckUtils]: 228: Hoare triple {12606#(<= main_~i~0 111)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12606#(<= main_~i~0 111)} is VALID [2022-04-27 10:34:05,633 INFO L290 TraceCheckUtils]: 229: Hoare triple {12606#(<= main_~i~0 111)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12607#(<= main_~i~0 112)} is VALID [2022-04-27 10:34:05,634 INFO L290 TraceCheckUtils]: 230: Hoare triple {12607#(<= main_~i~0 112)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12607#(<= main_~i~0 112)} is VALID [2022-04-27 10:34:05,634 INFO L290 TraceCheckUtils]: 231: Hoare triple {12607#(<= main_~i~0 112)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12608#(<= main_~i~0 113)} is VALID [2022-04-27 10:34:05,634 INFO L290 TraceCheckUtils]: 232: Hoare triple {12608#(<= main_~i~0 113)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12608#(<= main_~i~0 113)} is VALID [2022-04-27 10:34:05,634 INFO L290 TraceCheckUtils]: 233: Hoare triple {12608#(<= main_~i~0 113)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12609#(<= main_~i~0 114)} is VALID [2022-04-27 10:34:05,635 INFO L290 TraceCheckUtils]: 234: Hoare triple {12609#(<= main_~i~0 114)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12609#(<= main_~i~0 114)} is VALID [2022-04-27 10:34:05,635 INFO L290 TraceCheckUtils]: 235: Hoare triple {12609#(<= main_~i~0 114)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#(<= main_~i~0 115)} is VALID [2022-04-27 10:34:05,635 INFO L290 TraceCheckUtils]: 236: Hoare triple {12610#(<= main_~i~0 115)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#(<= main_~i~0 115)} is VALID [2022-04-27 10:34:05,636 INFO L290 TraceCheckUtils]: 237: Hoare triple {12610#(<= main_~i~0 115)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12611#(<= main_~i~0 116)} is VALID [2022-04-27 10:34:05,636 INFO L290 TraceCheckUtils]: 238: Hoare triple {12611#(<= main_~i~0 116)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12611#(<= main_~i~0 116)} is VALID [2022-04-27 10:34:05,636 INFO L290 TraceCheckUtils]: 239: Hoare triple {12611#(<= main_~i~0 116)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12612#(<= main_~i~0 117)} is VALID [2022-04-27 10:34:05,636 INFO L290 TraceCheckUtils]: 240: Hoare triple {12612#(<= main_~i~0 117)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12612#(<= main_~i~0 117)} is VALID [2022-04-27 10:34:05,637 INFO L290 TraceCheckUtils]: 241: Hoare triple {12612#(<= main_~i~0 117)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12613#(<= main_~i~0 118)} is VALID [2022-04-27 10:34:05,637 INFO L290 TraceCheckUtils]: 242: Hoare triple {12613#(<= main_~i~0 118)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12613#(<= main_~i~0 118)} is VALID [2022-04-27 10:34:05,637 INFO L290 TraceCheckUtils]: 243: Hoare triple {12613#(<= main_~i~0 118)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12614#(<= main_~i~0 119)} is VALID [2022-04-27 10:34:05,637 INFO L290 TraceCheckUtils]: 244: Hoare triple {12614#(<= main_~i~0 119)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12614#(<= main_~i~0 119)} is VALID [2022-04-27 10:34:05,638 INFO L290 TraceCheckUtils]: 245: Hoare triple {12614#(<= main_~i~0 119)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12615#(<= main_~i~0 120)} is VALID [2022-04-27 10:34:05,638 INFO L290 TraceCheckUtils]: 246: Hoare triple {12615#(<= main_~i~0 120)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12615#(<= main_~i~0 120)} is VALID [2022-04-27 10:34:05,638 INFO L290 TraceCheckUtils]: 247: Hoare triple {12615#(<= main_~i~0 120)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12616#(<= main_~i~0 121)} is VALID [2022-04-27 10:34:05,639 INFO L290 TraceCheckUtils]: 248: Hoare triple {12616#(<= main_~i~0 121)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12616#(<= main_~i~0 121)} is VALID [2022-04-27 10:34:05,639 INFO L290 TraceCheckUtils]: 249: Hoare triple {12616#(<= main_~i~0 121)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12617#(<= main_~i~0 122)} is VALID [2022-04-27 10:34:05,639 INFO L290 TraceCheckUtils]: 250: Hoare triple {12617#(<= main_~i~0 122)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12617#(<= main_~i~0 122)} is VALID [2022-04-27 10:34:05,639 INFO L290 TraceCheckUtils]: 251: Hoare triple {12617#(<= main_~i~0 122)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12618#(<= main_~i~0 123)} is VALID [2022-04-27 10:34:05,640 INFO L290 TraceCheckUtils]: 252: Hoare triple {12618#(<= main_~i~0 123)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12618#(<= main_~i~0 123)} is VALID [2022-04-27 10:34:05,640 INFO L290 TraceCheckUtils]: 253: Hoare triple {12618#(<= main_~i~0 123)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12619#(<= main_~i~0 124)} is VALID [2022-04-27 10:34:05,640 INFO L290 TraceCheckUtils]: 254: Hoare triple {12619#(<= main_~i~0 124)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12619#(<= main_~i~0 124)} is VALID [2022-04-27 10:34:05,641 INFO L290 TraceCheckUtils]: 255: Hoare triple {12619#(<= main_~i~0 124)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12620#(<= main_~i~0 125)} is VALID [2022-04-27 10:34:05,641 INFO L290 TraceCheckUtils]: 256: Hoare triple {12620#(<= main_~i~0 125)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12620#(<= main_~i~0 125)} is VALID [2022-04-27 10:34:05,641 INFO L290 TraceCheckUtils]: 257: Hoare triple {12620#(<= main_~i~0 125)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12621#(<= main_~i~0 126)} is VALID [2022-04-27 10:34:05,641 INFO L290 TraceCheckUtils]: 258: Hoare triple {12621#(<= main_~i~0 126)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12621#(<= main_~i~0 126)} is VALID [2022-04-27 10:34:05,642 INFO L290 TraceCheckUtils]: 259: Hoare triple {12621#(<= main_~i~0 126)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12622#(<= main_~i~0 127)} is VALID [2022-04-27 10:34:05,642 INFO L290 TraceCheckUtils]: 260: Hoare triple {12622#(<= main_~i~0 127)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12622#(<= main_~i~0 127)} is VALID [2022-04-27 10:34:05,642 INFO L290 TraceCheckUtils]: 261: Hoare triple {12622#(<= main_~i~0 127)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12623#(<= main_~i~0 128)} is VALID [2022-04-27 10:34:05,642 INFO L290 TraceCheckUtils]: 262: Hoare triple {12623#(<= main_~i~0 128)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12623#(<= main_~i~0 128)} is VALID [2022-04-27 10:34:05,643 INFO L290 TraceCheckUtils]: 263: Hoare triple {12623#(<= main_~i~0 128)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12624#(<= main_~i~0 129)} is VALID [2022-04-27 10:34:05,643 INFO L290 TraceCheckUtils]: 264: Hoare triple {12624#(<= main_~i~0 129)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12624#(<= main_~i~0 129)} is VALID [2022-04-27 10:34:05,643 INFO L290 TraceCheckUtils]: 265: Hoare triple {12624#(<= main_~i~0 129)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12625#(<= main_~i~0 130)} is VALID [2022-04-27 10:34:05,643 INFO L290 TraceCheckUtils]: 266: Hoare triple {12625#(<= main_~i~0 130)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12625#(<= main_~i~0 130)} is VALID [2022-04-27 10:34:05,644 INFO L290 TraceCheckUtils]: 267: Hoare triple {12625#(<= main_~i~0 130)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12626#(<= main_~i~0 131)} is VALID [2022-04-27 10:34:05,644 INFO L290 TraceCheckUtils]: 268: Hoare triple {12626#(<= main_~i~0 131)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12626#(<= main_~i~0 131)} is VALID [2022-04-27 10:34:05,644 INFO L290 TraceCheckUtils]: 269: Hoare triple {12626#(<= main_~i~0 131)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12627#(<= main_~i~0 132)} is VALID [2022-04-27 10:34:05,645 INFO L290 TraceCheckUtils]: 270: Hoare triple {12627#(<= main_~i~0 132)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12627#(<= main_~i~0 132)} is VALID [2022-04-27 10:34:05,645 INFO L290 TraceCheckUtils]: 271: Hoare triple {12627#(<= main_~i~0 132)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12628#(<= main_~i~0 133)} is VALID [2022-04-27 10:34:05,645 INFO L290 TraceCheckUtils]: 272: Hoare triple {12628#(<= main_~i~0 133)} assume !!(~i~0 < 1023);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12628#(<= main_~i~0 133)} is VALID [2022-04-27 10:34:05,645 INFO L290 TraceCheckUtils]: 273: Hoare triple {12628#(<= main_~i~0 133)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12629#(<= main_~i~0 134)} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 274: Hoare triple {12629#(<= main_~i~0 134)} assume !(~i~0 < 1023); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 275: Hoare triple {12491#false} call write~int(0, ~#A~0.base, 4092 + ~#A~0.offset, 4);~i~0 := 0; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 276: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 277: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 278: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 279: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 280: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 281: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 282: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 283: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 284: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 285: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 286: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 287: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 288: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 289: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,646 INFO L290 TraceCheckUtils]: 290: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 291: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 292: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 293: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 294: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 295: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 296: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 297: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 298: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 299: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 300: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 301: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 302: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 303: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 304: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 305: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 306: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 307: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 308: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 309: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 310: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 311: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,647 INFO L290 TraceCheckUtils]: 312: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 313: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 314: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 315: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 316: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 317: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 318: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 319: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 320: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 321: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 322: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 323: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 324: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 325: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 326: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 327: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 328: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 329: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 330: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 331: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 332: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 333: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,648 INFO L290 TraceCheckUtils]: 334: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 335: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 336: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 337: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 338: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 339: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 340: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 341: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 342: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 343: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 344: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 345: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 346: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 347: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 348: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 349: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 350: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 351: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 352: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 353: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 354: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 355: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 356: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,649 INFO L290 TraceCheckUtils]: 357: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 358: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 359: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 360: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 361: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 362: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 363: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 364: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 365: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 366: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 367: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 368: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 369: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 370: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 371: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 372: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 373: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 374: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 375: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 376: Hoare triple {12491#false} assume !!(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 377: Hoare triple {12491#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 378: Hoare triple {12491#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {12491#false} is VALID [2022-04-27 10:34:05,650 INFO L290 TraceCheckUtils]: 379: Hoare triple {12491#false} assume !(0 != #t~mem4);havoc #t~mem4; {12491#false} is VALID [2022-04-27 10:34:05,651 INFO L272 TraceCheckUtils]: 380: Hoare triple {12491#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {12491#false} is VALID [2022-04-27 10:34:05,651 INFO L290 TraceCheckUtils]: 381: Hoare triple {12491#false} ~cond := #in~cond; {12491#false} is VALID [2022-04-27 10:34:05,651 INFO L290 TraceCheckUtils]: 382: Hoare triple {12491#false} assume 0 == ~cond; {12491#false} is VALID [2022-04-27 10:34:05,651 INFO L290 TraceCheckUtils]: 383: Hoare triple {12491#false} assume !false; {12491#false} is VALID [2022-04-27 10:34:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19707 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-04-27 10:34:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:34:05,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005662762] [2022-04-27 10:34:05,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005662762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:34:05,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770998707] [2022-04-27 10:34:05,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:34:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:34:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:34:05,658 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-27 10:34:05,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process