java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_27_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:21,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:21,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:21,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:21,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:21,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:21,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:21,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:21,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:21,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:21,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:21,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:21,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:21,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:21,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:21,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:21,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:21,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:21,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:21,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:21,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:21,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:21,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:21,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:21,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:21,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:21,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:21,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:21,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:21,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:21,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:21,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:21,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:21,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:21,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:21,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:21,126 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:02:21,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:21,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:21,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:21,147 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:21,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:21,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:21,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:21,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:21,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:21,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:21,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:21,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:21,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:21,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:21,154 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:21,155 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:21,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:21,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:21,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:21,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:21,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:21,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:21,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:21,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:21,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:21,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:21,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:21,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:21,158 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:21,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:21,159 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:21,159 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:21,159 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:21,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:21,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:21,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:21,250 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:21,250 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:21,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_true-unreach-call_ground.i [2018-11-23 10:02:21,313 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619d0da4c/816b1cc50b7c4b4cb271bdce2af5a271/FLAG4b5c77934 [2018-11-23 10:02:21,786 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:21,786 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_true-unreach-call_ground.i [2018-11-23 10:02:21,792 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619d0da4c/816b1cc50b7c4b4cb271bdce2af5a271/FLAG4b5c77934 [2018-11-23 10:02:22,155 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619d0da4c/816b1cc50b7c4b4cb271bdce2af5a271 [2018-11-23 10:02:22,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:22,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:22,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:22,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:22,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:22,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7098ea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22, skipping insertion in model container [2018-11-23 10:02:22,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:22,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:22,454 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:22,460 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:22,485 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:22,514 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:22,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22 WrapperNode [2018-11-23 10:02:22,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:22,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:22,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:22,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:22,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:22,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:22,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:22,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:22,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... [2018-11-23 10:02:22,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:22,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:22,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:22,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:22,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:22,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:22,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:23,255 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:23,256 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:02:23,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:23 BoogieIcfgContainer [2018-11-23 10:02:23,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:23,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:23,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:23,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:23,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:22" (1/3) ... [2018-11-23 10:02:23,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e7c2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:23, skipping insertion in model container [2018-11-23 10:02:23,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:22" (2/3) ... [2018-11-23 10:02:23,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e7c2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:23, skipping insertion in model container [2018-11-23 10:02:23,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:23" (3/3) ... [2018-11-23 10:02:23,266 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_true-unreach-call_ground.i [2018-11-23 10:02:23,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:23,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:23,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:23,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:23,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:23,341 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:23,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:23,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:23,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:23,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:23,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:23,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 10:02:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:02:23,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:23,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:23,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:23,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash -132821438, now seen corresponding path program 1 times [2018-11-23 10:02:23,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:23,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:23,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:23,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 10:02:23,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 10:02:23,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 10:02:23,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2018-11-23 10:02:23,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2018-11-23 10:02:23,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {28#true} is VALID [2018-11-23 10:02:23,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 10:02:23,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0bv32; {29#false} is VALID [2018-11-23 10:02:23,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {29#false} is VALID [2018-11-23 10:02:23,572 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 10:02:23,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 10:02:23,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 10:02:23,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 10:02:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:23,576 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:23,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:23,592 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:02:23,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:23,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:23,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:23,765 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 10:02:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,079 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:02:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:24,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:02:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:02:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:02:24,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 10:02:24,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:24,261 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:02:24,261 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:02:24,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:02:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:02:24,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:24,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:02:24,336 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:02:24,336 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:02:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,340 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:02:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:02:24,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:24,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:24,341 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:02:24,341 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:02:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,345 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:02:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:02:24,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:24,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:24,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:24,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:02:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:02:24,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 10:02:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:24,351 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:02:24,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:02:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:02:24,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:24,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:24,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:24,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1305427337, now seen corresponding path program 1 times [2018-11-23 10:02:24,354 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:24,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:24,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:24,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {188#true} call ULTIMATE.init(); {188#true} is VALID [2018-11-23 10:02:24,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {188#true} is VALID [2018-11-23 10:02:24,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {188#true} assume true; {188#true} is VALID [2018-11-23 10:02:24,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} #54#return; {188#true} is VALID [2018-11-23 10:02:24,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {188#true} call #t~ret6 := main(); {188#true} is VALID [2018-11-23 10:02:24,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {208#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:24,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {189#false} is VALID [2018-11-23 10:02:24,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#false} havoc ~x~0;~x~0 := 0bv32; {189#false} is VALID [2018-11-23 10:02:24,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {189#false} is VALID [2018-11-23 10:02:24,509 INFO L256 TraceCheckUtils]: 9: Hoare triple {189#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {189#false} is VALID [2018-11-23 10:02:24,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2018-11-23 10:02:24,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {189#false} assume 0bv32 == ~cond; {189#false} is VALID [2018-11-23 10:02:24,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {189#false} assume !false; {189#false} is VALID [2018-11-23 10:02:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:24,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:24,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:24,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:24,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:02:24,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:24,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:24,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:24,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:24,560 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 10:02:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:24,759 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 10:02:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:24,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:02:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 10:02:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 10:02:24,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 10:02:25,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:25,089 INFO L225 Difference]: With dead ends: 34 [2018-11-23 10:02:25,089 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 10:02:25,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 10:02:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 10:02:25,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:25,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 10:02:25,196 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 10:02:25,197 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 10:02:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:25,199 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 10:02:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 10:02:25,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:25,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:25,200 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 10:02:25,200 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 10:02:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:25,203 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 10:02:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 10:02:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:25,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:25,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:25,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:02:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 10:02:25,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 10:02:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:25,207 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 10:02:25,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:02:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:02:25,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:25,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:25,209 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:25,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -11566460, now seen corresponding path program 1 times [2018-11-23 10:02:25,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:25,217 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:25,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:25,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:25,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 10:02:25,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 10:02:25,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 10:02:25,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #54#return; {351#true} is VALID [2018-11-23 10:02:25,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 10:02:25,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:25,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:25,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:25,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {371#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {381#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:25,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#(= (_ bv2 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 10:02:25,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 10:02:25,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 10:02:25,440 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 10:02:25,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 10:02:25,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 10:02:25,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 10:02:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:25,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:25,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 10:02:25,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 10:02:25,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 10:02:25,518 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 10:02:25,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 10:02:25,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 10:02:25,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {421#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 10:02:25,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {421#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:25,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:25,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:25,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:25,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 10:02:25,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #54#return; {351#true} is VALID [2018-11-23 10:02:25,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 10:02:25,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 10:02:25,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 10:02:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:25,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:25,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:25,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:02:25,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:25,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:25,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:25,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:25,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:25,666 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-11-23 10:02:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:25,984 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:02:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:25,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:02:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 10:02:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 10:02:25,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 10:02:26,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:26,178 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:02:26,178 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:02:26,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:02:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 10:02:26,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:26,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 10:02:26,199 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 10:02:26,199 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 10:02:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:26,202 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 10:02:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:02:26,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:26,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:26,204 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 10:02:26,204 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 10:02:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:26,207 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 10:02:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:02:26,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:26,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:26,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:26,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:02:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 10:02:26,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2018-11-23 10:02:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:26,211 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 10:02:26,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:02:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:02:26,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:26,213 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:26,213 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:26,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2024959031, now seen corresponding path program 2 times [2018-11-23 10:02:26,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:26,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:26,232 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:26,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:26,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:26,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:26,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 10:02:26,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 10:02:26,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 10:02:26,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #54#return; {612#true} is VALID [2018-11-23 10:02:26,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret6 := main(); {612#true} is VALID [2018-11-23 10:02:26,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {632#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {642#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:26,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {642#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {642#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:26,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {642#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {642#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:26,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {662#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:26,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {662#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:26,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(= (_ bv4 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {662#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:26,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(= (_ bv4 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {672#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:26,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {672#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 10:02:26,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 10:02:26,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 10:02:26,440 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 10:02:26,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 10:02:26,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 10:02:26,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 10:02:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:26,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:26,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 10:02:26,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 10:02:26,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 10:02:26,721 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 10:02:26,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 10:02:26,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 10:02:26,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {712#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 10:02:26,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {712#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:26,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:26,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret6 := main(); {612#true} is VALID [2018-11-23 10:02:26,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #54#return; {612#true} is VALID [2018-11-23 10:02:26,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 10:02:26,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 10:02:26,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 10:02:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:26,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:26,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:26,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:02:26,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:26,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:26,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:26,855 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 12 states. [2018-11-23 10:02:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:27,966 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 10:02:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:27,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:02:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:02:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:02:27,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 10:02:28,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:28,141 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:02:28,141 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 10:02:28,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 10:02:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 10:02:28,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:28,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 10:02:28,204 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 10:02:28,204 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 10:02:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:28,207 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 10:02:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:02:28,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:28,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:28,208 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 10:02:28,209 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 10:02:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:28,212 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 10:02:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:02:28,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:28,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:28,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:28,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:02:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 10:02:28,217 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 25 [2018-11-23 10:02:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:28,217 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 10:02:28,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:02:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 10:02:28,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:28,219 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:28,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:28,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1696809257, now seen corresponding path program 3 times [2018-11-23 10:02:28,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:28,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:28,238 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:28,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:02:28,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:28,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:28,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 10:02:28,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 10:02:28,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 10:02:28,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #54#return; {1023#true} is VALID [2018-11-23 10:02:28,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret6 := main(); {1023#true} is VALID [2018-11-23 10:02:28,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {1043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1053#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:28,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1053#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:28,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1053#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:28,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1073#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:28,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {1073#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1073#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:28,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {1073#(= (_ bv4 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1073#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:28,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {1073#(= (_ bv4 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1093#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:28,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1093#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:28,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#(= (_ bv6 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1093#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:28,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#(= (_ bv6 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1113#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:28,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {1113#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1113#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:28,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {1113#(= (_ bv8 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1113#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:28,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {1113#(= (_ bv8 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,937 INFO L273 TraceCheckUtils]: 30: Hoare triple {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {1123#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1133#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:28,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1133#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:28,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#(= (_ bv10 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1133#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:28,943 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#(= (_ bv10 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1143#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:28,943 INFO L273 TraceCheckUtils]: 36: Hoare triple {1143#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 10:02:28,943 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 10:02:28,944 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 10:02:28,944 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 10:02:28,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 10:02:28,944 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 10:02:28,944 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 10:02:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:28,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:29,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 10:02:29,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 10:02:29,732 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 10:02:29,732 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 10:02:29,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 10:02:29,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 10:02:29,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {1183#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 10:02:29,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1183#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:29,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:29,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret6 := main(); {1023#true} is VALID [2018-11-23 10:02:29,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #54#return; {1023#true} is VALID [2018-11-23 10:02:29,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 10:02:29,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 10:02:29,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 10:02:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:29,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:29,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:29,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:02:29,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:29,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:30,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:30,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:30,032 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 24 states. [2018-11-23 10:02:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,153 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2018-11-23 10:02:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:34,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:02:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 10:02:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 10:02:34,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2018-11-23 10:02:34,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,647 INFO L225 Difference]: With dead ends: 95 [2018-11-23 10:02:34,647 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 10:02:34,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 10:02:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 10:02:34,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-23 10:02:34,720 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 10:02:34,720 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 10:02:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,724 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 10:02:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:02:34,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,726 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 10:02:34,726 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 10:02:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,730 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 10:02:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:02:34,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 10:02:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 10:02:34,736 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 43 [2018-11-23 10:02:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,736 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 10:02:34,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:02:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 10:02:34,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,740 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:34,740 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1143024663, now seen corresponding path program 4 times [2018-11-23 10:02:34,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:34,772 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:34,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:34,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:34,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 10:02:35,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 10:02:35,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 10:02:35,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #54#return; {1734#true} is VALID [2018-11-23 10:02:35,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret6 := main(); {1734#true} is VALID [2018-11-23 10:02:35,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {1754#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1764#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:35,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1764#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:35,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1764#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:35,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {1774#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1784#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:35,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {1784#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1784#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:35,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {1784#(= (_ bv4 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1784#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:35,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {1784#(= (_ bv4 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {1794#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1804#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:35,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1804#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:35,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#(= (_ bv6 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1804#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:35,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#(= (_ bv6 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1824#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:35,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1824#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:35,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {1824#(= (_ bv8 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1824#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:35,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {1824#(= (_ bv8 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1844#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:35,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {1844#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1844#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:35,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {1844#(= (_ bv10 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1844#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:35,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {1844#(= (_ bv10 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1864#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:35,534 INFO L273 TraceCheckUtils]: 39: Hoare triple {1864#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1864#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:35,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {1864#(= (_ bv12 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1864#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:35,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {1864#(= (_ bv12 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,537 INFO L273 TraceCheckUtils]: 43: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1884#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:35,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {1884#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1884#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:35,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {1884#(= (_ bv14 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1884#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:35,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {1884#(= (_ bv14 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,540 INFO L273 TraceCheckUtils]: 48: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,542 INFO L273 TraceCheckUtils]: 50: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1904#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:35,542 INFO L273 TraceCheckUtils]: 51: Hoare triple {1904#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1904#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:35,543 INFO L273 TraceCheckUtils]: 52: Hoare triple {1904#(= (_ bv16 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1904#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:35,544 INFO L273 TraceCheckUtils]: 53: Hoare triple {1904#(= (_ bv16 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,544 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1924#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:35,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {1924#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1924#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:35,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {1924#(= (_ bv18 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1924#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:35,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {1924#(= (_ bv18 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,559 INFO L273 TraceCheckUtils]: 62: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1944#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:35,560 INFO L273 TraceCheckUtils]: 63: Hoare triple {1944#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1944#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:35,560 INFO L273 TraceCheckUtils]: 64: Hoare triple {1944#(= (_ bv20 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1944#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:35,560 INFO L273 TraceCheckUtils]: 65: Hoare triple {1944#(= (_ bv20 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,562 INFO L273 TraceCheckUtils]: 70: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,563 INFO L273 TraceCheckUtils]: 71: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1974#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,563 INFO L273 TraceCheckUtils]: 72: Hoare triple {1974#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 10:02:35,564 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 10:02:35,564 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 10:02:35,564 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 10:02:35,565 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 10:02:35,565 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 10:02:35,565 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 10:02:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:35,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:37,690 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 10:02:37,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 10:02:37,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 10:02:37,691 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 10:02:37,691 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 10:02:37,691 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 10:02:37,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {2014#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 10:02:37,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2014#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:37,693 INFO L273 TraceCheckUtils]: 70: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,693 INFO L273 TraceCheckUtils]: 69: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,698 INFO L273 TraceCheckUtils]: 68: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,699 INFO L273 TraceCheckUtils]: 67: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,707 INFO L273 TraceCheckUtils]: 63: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,730 INFO L273 TraceCheckUtils]: 62: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,736 INFO L273 TraceCheckUtils]: 61: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,736 INFO L273 TraceCheckUtils]: 60: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,743 INFO L273 TraceCheckUtils]: 57: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,750 INFO L273 TraceCheckUtils]: 56: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,751 INFO L273 TraceCheckUtils]: 55: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,784 INFO L273 TraceCheckUtils]: 45: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,793 INFO L273 TraceCheckUtils]: 44: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,794 INFO L273 TraceCheckUtils]: 43: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret6 := main(); {1734#true} is VALID [2018-11-23 10:02:37,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #54#return; {1734#true} is VALID [2018-11-23 10:02:37,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 10:02:37,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 10:02:37,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 10:02:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:37,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:37,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:37,889 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:02:37,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:38,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:38,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:38,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:38,246 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 48 states. [2018-11-23 10:02:46,599 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:47,126 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:47,671 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:48,240 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:48,838 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:49,431 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:02:50,059 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:02:50,739 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:02:52,965 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 7 [2018-11-23 10:02:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:57,573 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2018-11-23 10:02:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:02:57,573 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:02:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:02:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 10:02:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:02:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 10:02:57,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 238 transitions. [2018-11-23 10:02:58,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:58,076 INFO L225 Difference]: With dead ends: 167 [2018-11-23 10:02:58,076 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 10:02:58,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:02:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 10:02:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-11-23 10:02:58,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:58,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2018-11-23 10:02:58,141 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:02:58,141 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:02:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:58,147 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 10:02:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:02:58,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:58,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:58,148 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:02:58,148 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:02:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:58,154 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 10:02:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:02:58,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:58,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:58,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:58,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 10:02:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 10:02:58,161 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 79 [2018-11-23 10:02:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:58,162 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 10:02:58,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:02:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:02:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 10:02:58,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:58,167 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:58,168 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -738122089, now seen corresponding path program 5 times [2018-11-23 10:02:58,169 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:58,194 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 10:03:07,483 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 10:03:07,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:03:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:03:07,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:03:09,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 10:03:09,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 10:03:09,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 10:03:09,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #54#return; {3045#true} is VALID [2018-11-23 10:03:09,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret6 := main(); {3045#true} is VALID [2018-11-23 10:03:09,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {3065#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3075#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:03:09,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {3075#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3075#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:03:09,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {3075#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3075#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:03:09,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {3075#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3095#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:03:09,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {3095#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3095#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:03:09,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {3095#(= (_ bv4 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3095#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:03:09,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {3095#(= (_ bv4 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3115#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:03:09,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3115#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:03:09,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(= (_ bv6 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3115#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:03:09,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {3115#(= (_ bv6 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3135#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:03:09,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {3135#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3135#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:03:09,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {3135#(= (_ bv8 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3135#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:03:09,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {3135#(= (_ bv8 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {3145#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3155#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:03:09,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {3155#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3155#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:03:09,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {3155#(= (_ bv10 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3155#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:03:09,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {3155#(= (_ bv10 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3175#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:03:09,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {3175#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3175#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:03:09,441 INFO L273 TraceCheckUtils]: 40: Hoare triple {3175#(= (_ bv12 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3175#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:03:09,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {3175#(= (_ bv12 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {3185#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3195#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:03:09,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {3195#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3195#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:03:09,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {3195#(= (_ bv14 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3195#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:03:09,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {3195#(= (_ bv14 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3215#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:03:09,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {3215#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3215#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:03:09,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {3215#(= (_ bv16 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3215#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:03:09,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {3215#(= (_ bv16 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,450 INFO L273 TraceCheckUtils]: 56: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3235#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:03:09,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {3235#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3235#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:03:09,451 INFO L273 TraceCheckUtils]: 58: Hoare triple {3235#(= (_ bv18 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3235#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:03:09,452 INFO L273 TraceCheckUtils]: 59: Hoare triple {3235#(= (_ bv18 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,452 INFO L273 TraceCheckUtils]: 60: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,454 INFO L273 TraceCheckUtils]: 62: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3255#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:03:09,454 INFO L273 TraceCheckUtils]: 63: Hoare triple {3255#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3255#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:03:09,455 INFO L273 TraceCheckUtils]: 64: Hoare triple {3255#(= (_ bv20 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3255#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:03:09,456 INFO L273 TraceCheckUtils]: 65: Hoare triple {3255#(= (_ bv20 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,456 INFO L273 TraceCheckUtils]: 66: Hoare triple {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,458 INFO L273 TraceCheckUtils]: 68: Hoare triple {3265#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,458 INFO L273 TraceCheckUtils]: 69: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,459 INFO L273 TraceCheckUtils]: 70: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,459 INFO L273 TraceCheckUtils]: 71: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,460 INFO L273 TraceCheckUtils]: 72: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,461 INFO L273 TraceCheckUtils]: 73: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,461 INFO L273 TraceCheckUtils]: 74: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,462 INFO L273 TraceCheckUtils]: 75: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,463 INFO L273 TraceCheckUtils]: 76: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,463 INFO L273 TraceCheckUtils]: 77: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3305#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:03:09,464 INFO L273 TraceCheckUtils]: 78: Hoare triple {3305#(= (_ bv25 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3305#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:03:09,465 INFO L273 TraceCheckUtils]: 79: Hoare triple {3305#(= (_ bv25 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3305#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:03:09,465 INFO L273 TraceCheckUtils]: 80: Hoare triple {3305#(= (_ bv25 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,466 INFO L273 TraceCheckUtils]: 81: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,466 INFO L273 TraceCheckUtils]: 82: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,467 INFO L273 TraceCheckUtils]: 83: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3325#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:03:09,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {3325#(= (_ bv27 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3325#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:03:09,468 INFO L273 TraceCheckUtils]: 85: Hoare triple {3325#(= (_ bv27 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3325#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:03:09,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {3325#(= (_ bv27 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,470 INFO L273 TraceCheckUtils]: 88: Hoare triple {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {3335#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3345#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:03:09,471 INFO L273 TraceCheckUtils]: 90: Hoare triple {3345#(= (_ bv29 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3345#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:03:09,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {3345#(= (_ bv29 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3345#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:03:09,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {3345#(= (_ bv29 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {3355#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3365#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:03:09,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {3365#(= (_ bv31 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3365#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:03:09,482 INFO L273 TraceCheckUtils]: 97: Hoare triple {3365#(= (_ bv31 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3365#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:03:09,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {3365#(= (_ bv31 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,483 INFO L273 TraceCheckUtils]: 100: Hoare triple {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {3375#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3385#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:03:09,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {3385#(= (_ bv33 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3385#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:03:09,485 INFO L273 TraceCheckUtils]: 103: Hoare triple {3385#(= (_ bv33 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3385#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:03:09,485 INFO L273 TraceCheckUtils]: 104: Hoare triple {3385#(= (_ bv33 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,486 INFO L273 TraceCheckUtils]: 106: Hoare triple {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,486 INFO L273 TraceCheckUtils]: 107: Hoare triple {3395#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3405#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:03:09,487 INFO L273 TraceCheckUtils]: 108: Hoare triple {3405#(= (_ bv35 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3405#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:03:09,487 INFO L273 TraceCheckUtils]: 109: Hoare triple {3405#(= (_ bv35 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3405#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:03:09,488 INFO L273 TraceCheckUtils]: 110: Hoare triple {3405#(= (_ bv35 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,488 INFO L273 TraceCheckUtils]: 111: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,489 INFO L273 TraceCheckUtils]: 112: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,490 INFO L273 TraceCheckUtils]: 113: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3425#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:03:09,490 INFO L273 TraceCheckUtils]: 114: Hoare triple {3425#(= (_ bv37 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3425#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:03:09,491 INFO L273 TraceCheckUtils]: 115: Hoare triple {3425#(= (_ bv37 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3425#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:03:09,492 INFO L273 TraceCheckUtils]: 116: Hoare triple {3425#(= (_ bv37 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,493 INFO L273 TraceCheckUtils]: 118: Hoare triple {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,494 INFO L273 TraceCheckUtils]: 119: Hoare triple {3435#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3445#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:03:09,494 INFO L273 TraceCheckUtils]: 120: Hoare triple {3445#(= (_ bv39 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3445#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:03:09,495 INFO L273 TraceCheckUtils]: 121: Hoare triple {3445#(= (_ bv39 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3445#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:03:09,495 INFO L273 TraceCheckUtils]: 122: Hoare triple {3445#(= (_ bv39 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,496 INFO L273 TraceCheckUtils]: 123: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,496 INFO L273 TraceCheckUtils]: 124: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3465#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:03:09,498 INFO L273 TraceCheckUtils]: 126: Hoare triple {3465#(= (_ bv41 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3465#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:03:09,498 INFO L273 TraceCheckUtils]: 127: Hoare triple {3465#(= (_ bv41 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3465#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:03:09,499 INFO L273 TraceCheckUtils]: 128: Hoare triple {3465#(= (_ bv41 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,499 INFO L273 TraceCheckUtils]: 129: Hoare triple {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,500 INFO L273 TraceCheckUtils]: 130: Hoare triple {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,501 INFO L273 TraceCheckUtils]: 131: Hoare triple {3475#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3485#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:03:09,501 INFO L273 TraceCheckUtils]: 132: Hoare triple {3485#(= (_ bv43 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3485#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:03:09,502 INFO L273 TraceCheckUtils]: 133: Hoare triple {3485#(= (_ bv43 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3485#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:03:09,503 INFO L273 TraceCheckUtils]: 134: Hoare triple {3485#(= (_ bv43 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,503 INFO L273 TraceCheckUtils]: 135: Hoare triple {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,504 INFO L273 TraceCheckUtils]: 136: Hoare triple {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,504 INFO L273 TraceCheckUtils]: 137: Hoare triple {3495#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3505#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:03:09,505 INFO L273 TraceCheckUtils]: 138: Hoare triple {3505#(= (_ bv45 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3505#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:03:09,506 INFO L273 TraceCheckUtils]: 139: Hoare triple {3505#(= (_ bv45 32) main_~i~0)} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3505#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:03:09,506 INFO L273 TraceCheckUtils]: 140: Hoare triple {3505#(= (_ bv45 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,507 INFO L273 TraceCheckUtils]: 141: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,508 INFO L273 TraceCheckUtils]: 142: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:03:09,516 INFO L273 TraceCheckUtils]: 143: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3525#(= (_ bv47 32) main_~i~0)} is VALID [2018-11-23 10:03:09,516 INFO L273 TraceCheckUtils]: 144: Hoare triple {3525#(= (_ bv47 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 10:03:09,517 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 10:03:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:03:09,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:03:17,498 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 10:03:17,499 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 10:03:17,499 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 10:03:17,499 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsge32(~largest~0, #t~mem5) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 10:03:17,500 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 10:03:17,500 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 10:03:17,501 INFO L273 TraceCheckUtils]: 144: Hoare triple {3565#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 10:03:17,501 INFO L273 TraceCheckUtils]: 143: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3565#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:03:17,502 INFO L273 TraceCheckUtils]: 142: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,516 INFO L273 TraceCheckUtils]: 141: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,520 INFO L273 TraceCheckUtils]: 140: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,521 INFO L273 TraceCheckUtils]: 139: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,521 INFO L273 TraceCheckUtils]: 138: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,529 INFO L273 TraceCheckUtils]: 137: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,530 INFO L273 TraceCheckUtils]: 136: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,530 INFO L273 TraceCheckUtils]: 135: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,537 INFO L273 TraceCheckUtils]: 134: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,537 INFO L273 TraceCheckUtils]: 133: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,538 INFO L273 TraceCheckUtils]: 132: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,544 INFO L273 TraceCheckUtils]: 131: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,544 INFO L273 TraceCheckUtils]: 130: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,545 INFO L273 TraceCheckUtils]: 129: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,550 INFO L273 TraceCheckUtils]: 128: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,550 INFO L273 TraceCheckUtils]: 127: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,555 INFO L273 TraceCheckUtils]: 126: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,564 INFO L273 TraceCheckUtils]: 125: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,565 INFO L273 TraceCheckUtils]: 124: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,565 INFO L273 TraceCheckUtils]: 123: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,571 INFO L273 TraceCheckUtils]: 122: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,571 INFO L273 TraceCheckUtils]: 121: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,572 INFO L273 TraceCheckUtils]: 120: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,579 INFO L273 TraceCheckUtils]: 119: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,579 INFO L273 TraceCheckUtils]: 118: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,580 INFO L273 TraceCheckUtils]: 117: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,587 INFO L273 TraceCheckUtils]: 116: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,588 INFO L273 TraceCheckUtils]: 115: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,588 INFO L273 TraceCheckUtils]: 114: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,595 INFO L273 TraceCheckUtils]: 113: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,595 INFO L273 TraceCheckUtils]: 112: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,596 INFO L273 TraceCheckUtils]: 111: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,602 INFO L273 TraceCheckUtils]: 110: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,602 INFO L273 TraceCheckUtils]: 109: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,603 INFO L273 TraceCheckUtils]: 108: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,608 INFO L273 TraceCheckUtils]: 107: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,608 INFO L273 TraceCheckUtils]: 106: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,609 INFO L273 TraceCheckUtils]: 105: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,614 INFO L273 TraceCheckUtils]: 104: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,615 INFO L273 TraceCheckUtils]: 103: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,615 INFO L273 TraceCheckUtils]: 102: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,623 INFO L273 TraceCheckUtils]: 101: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,623 INFO L273 TraceCheckUtils]: 100: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,624 INFO L273 TraceCheckUtils]: 99: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,633 INFO L273 TraceCheckUtils]: 98: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,634 INFO L273 TraceCheckUtils]: 97: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,634 INFO L273 TraceCheckUtils]: 96: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,640 INFO L273 TraceCheckUtils]: 94: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,640 INFO L273 TraceCheckUtils]: 93: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,646 INFO L273 TraceCheckUtils]: 92: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,647 INFO L273 TraceCheckUtils]: 91: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,647 INFO L273 TraceCheckUtils]: 90: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,653 INFO L273 TraceCheckUtils]: 88: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,653 INFO L273 TraceCheckUtils]: 87: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,659 INFO L273 TraceCheckUtils]: 86: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,659 INFO L273 TraceCheckUtils]: 85: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,660 INFO L273 TraceCheckUtils]: 84: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,669 INFO L273 TraceCheckUtils]: 83: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,669 INFO L273 TraceCheckUtils]: 82: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,670 INFO L273 TraceCheckUtils]: 81: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,675 INFO L273 TraceCheckUtils]: 80: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,676 INFO L273 TraceCheckUtils]: 78: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,683 INFO L273 TraceCheckUtils]: 77: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,683 INFO L273 TraceCheckUtils]: 76: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,684 INFO L273 TraceCheckUtils]: 75: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,689 INFO L273 TraceCheckUtils]: 74: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,690 INFO L273 TraceCheckUtils]: 73: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,690 INFO L273 TraceCheckUtils]: 72: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,696 INFO L273 TraceCheckUtils]: 71: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,712 INFO L273 TraceCheckUtils]: 63: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,726 INFO L273 TraceCheckUtils]: 59: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,727 INFO L273 TraceCheckUtils]: 58: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,727 INFO L273 TraceCheckUtils]: 57: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,735 INFO L273 TraceCheckUtils]: 55: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,735 INFO L273 TraceCheckUtils]: 54: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,741 INFO L273 TraceCheckUtils]: 53: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,741 INFO L273 TraceCheckUtils]: 52: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,749 INFO L273 TraceCheckUtils]: 50: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,768 INFO L273 TraceCheckUtils]: 44: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,768 INFO L273 TraceCheckUtils]: 43: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,776 INFO L273 TraceCheckUtils]: 39: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,790 INFO L273 TraceCheckUtils]: 35: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume ~bvslt32(~largest~0, #t~mem2);havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest~0 := #t~mem3;havoc #t~mem3; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest~0 := #t~mem0;havoc #t~mem0;~i~0 := 1bv32; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:17,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret6 := main(); {3045#true} is VALID [2018-11-23 10:03:17,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #54#return; {3045#true} is VALID [2018-11-23 10:03:17,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 10:03:17,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 10:03:17,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 10:03:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:03:17,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:03:17,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 10:03:17,890 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 10:03:17,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:03:17,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 10:03:18,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:18,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 10:03:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 10:03:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 10:03:18,703 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 96 states. [2018-11-23 10:03:50,073 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 10:03:52,082 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 10:03:54,287 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2018-11-23 10:03:56,591 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 7 [2018-11-23 10:03:58,976 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 7 [2018-11-23 10:04:01,418 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 10:04:04,083 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 10:04:06,698 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 7 [2018-11-23 10:04:09,189 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 7 [2018-11-23 10:04:11,993 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2018-11-23 10:04:14,841 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 10:04:17,492 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 10:04:20,144 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 10:04:22,891 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 10:04:25,650 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 10:04:28,368 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 10:04:30,879 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 10:04:33,570 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 10:04:36,229 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 10:04:39,041 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 10:04:41,807 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 10:04:44,406 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 10:04:46,841 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 10:04:49,389 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 10:04:51,748 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:04:54,172 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:04:56,449 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:04:58,606 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:05:00,739 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:05:02,835 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:05:04,723 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:05:06,582 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:05:08,449 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 7 [2018-11-23 10:05:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:22,742 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2018-11-23 10:05:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-23 10:05:22,743 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 10:05:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:05:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:05:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:05:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:05:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:05:22,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 454 transitions. [2018-11-23 10:05:23,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:05:23,924 INFO L225 Difference]: With dead ends: 311 [2018-11-23 10:05:23,924 INFO L226 Difference]: Without dead ends: 300 [2018-11-23 10:05:23,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 97.7s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2018-11-23 10:05:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-23 10:05:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-11-23 10:05:24,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:05:24,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand 300 states. [2018-11-23 10:05:24,066 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:05:24,066 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:05:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:24,078 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:05:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:05:24,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:05:24,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:05:24,080 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:05:24,080 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:05:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:24,091 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:05:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:05:24,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:05:24,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:05:24,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:05:24,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:05:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 10:05:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2018-11-23 10:05:24,104 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 151 [2018-11-23 10:05:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:05:24,105 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2018-11-23 10:05:24,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 10:05:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:05:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-23 10:05:24,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:05:24,110 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:05:24,111 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:05:24,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:05:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1579312233, now seen corresponding path program 6 times [2018-11-23 10:05:24,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:05:24,112 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:05:24,138 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 10:06:01,750 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2018-11-23 10:06:01,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:02,076 INFO L273 TraceCheckSpWp]: Computing forward predicates...